4 results
Paolo Baldan ; Andrea Corradini ; Hartmut Ehrig ; Reiko Heckel ; Barbara König.
We propose a framework for the specification of behaviour-preserving reconfigurations of systems modelled as Petri nets. The framework is based on open nets, a mild generalisation of ordinary Place/Transition nets suited to model open systems which might interact with the surrounding environment and […]
Published on October 21, 2008
Henning Kerstan ; Barbara König.
Coalgebras in a Kleisli category yield a generic definition of trace semantics for various types of labelled transition systems. In this paper we apply this generic theory to generative probabilistic transition systems, short PTS, with arbitrary (possibly uncountable) state spaces. We consider the […]
Published on December 4, 2013
Mathias Hülsbusch ; Barbara König ; Sebastian Küpper ; Lara Stoltenow.
Reactive systems \`a la Leifer and Milner, an abstract categorical framework for rewriting, provide a suitable framework for deriving bisimulation congruences. This is done by synthesizing interactions with the environment in order to obtain a compositional semantics. We enrich the notion of […]
Published on January 12, 2022
Paolo Baldan ; Richard Eggert ; Barbara König ; Tommaso Padoan.
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below the greatest fixpoint (e.g., for providing bisimilarity […]
Published on June 7, 2023