Maximality preservation and the ST-idea for action refinements

The paper shows, in the framework of labelled P/T nets, that strengthening classical bisimulations through a maximality preservation property or through the introduction of ST-configurations leads to equivalent bisimulation notions, that they are preserved by a large class of action refinements, that they may be characterized through specific refinements and that they are the coarsest equivalences preserved by refinements and implying the original bisimulations.

[1]  Ursula Goltz,et al.  Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.

[2]  J.J.C. Meijer,et al.  Refinement in branching time semantics , 1989 .

[3]  H. Pomello,et al.  Observing net behaviour , 1987 .

[4]  Rob J. van Glabbeek.  The Refinement Theorem for ST-bisimulation Semantics , 1990, Programming Concepts and Methods.

[5]  Rocco De Nicola,et al.  Partial orderings descriptions and observations of nondeterministic concurrent processes , 1988, REX Workshop.

[6]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[7]  Rob J. van Glabbeek,et al.  Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[8]  Wilfried Brauer,et al.  A survey of behaviour and equivalence preserving refinements of Petri nets , 1991, Applications and Theory of Petri Nets.

[9]  Grzegorz Rozenberg,et al.  Subset Languages of Petri Nets Part I: The Relationship to String Languages and Normal Forms , 1983, Theor. Comput. Sci..

[10]  Ursula Goltz,et al.  Refinement of Actions in Causality Based Models , 1990, REX Workshop.

[11]  Walter Vogler,et al.  Bisimulation and Action Refinement , 1991, Theor. Comput. Sci..

[12]  Walter Vogler,et al.  Executions: A New Partial-Order Semantics of Petri Nets , 1991, Theor. Comput. Sci..

[13]  Raymond R. Devillers,et al.  Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..

[14]  Lucia Pomello,et al.  Some equivalence notions for concurrent systems. An overview , 1985, Applications and Theory in Petri Nets.

[15]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.

[16]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[17]  Grzegorz Rozenberg,et al.  Subset Languages of Petri Nets , 1982, European Workshop on Applications and Theory of Petri Nets.

[18]  Walter Vogler.  Deciding History Preserving Bisimilarity , 1991, ICALP.