论文信息 - Strong Bisimilarity on Nets Revisited

Strong Bisimilarity on Nets Revisited

In [Old89b], Olderog proposed a new notion of bisimulation between Petri nets. His proposal considers bisimulations between places of nets rather than between markings. Unfortunately, his definition leads to several problems that have not been noticed. It turns out that the situation is more complicated than in classical bisimulation theory over transition systems.

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

[2] Wolfgang Reisig. Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[3] Jan A. Bergstra,et al. Process theory based on bisimulation semantics , 1988, REX Workshop.

[4] Z. Belmesk,et al. Strong bisimilarity on nets revisited (extended abstract) , 1991 .

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

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

[7] P. S. Thiagarajan,et al. Degrees of Non-Determinism and Concurrency: A Petri Net View , 1984, FSTTCS.

[8] Ursula Goltz. On Representing CCS Programs by Finite Petri Nets , 1988, MFCS.

[9] Ernst-Rüdiger Olderog,et al. Operational Petri net semantics for CCSP , 1986, European Workshop on Applications and Theory of Petri Nets.

[10] Ernst-Rüdiger Olderog,et al. Strong bisimilarity on nets: a new concept for comparing net semantics , 1988, REX Workshop.

[11] Raymond R. Devillers. Maximality Preserving Bisimulation , 1992, Theor. Comput. Sci..