Maximality Preserving Bisimulation

Abstract A new bisimulation notion is introduced for the specification of concurrent systems, which resists to a large class of action refinements, even in the presence of invisible actions. The work is presented in the context of labelled P/T nets, but it may be transported to other popular frameworks like prime event structures, process graphs, etc.

[1]  Karl Martin Schmidt-Reindl,et al.  Notations and terminology on Petri Net theory , 1987 .

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

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

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

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

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

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

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

[9]  Walter Vogler.  Failures Semantics Based on Interval Semiwords is a Congruence for Refinement , 1990, STACS.

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

[11]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

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

[13]  Philippe Schnoebelen,et al.  τ-Bisimulations and Full Abstraction for Refinement of Actions , 1991, Inf. Process. Lett..

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