论文信息 - Semantic reachability

Semantic reachability

This paper is an approach to combine the reachability problem with semantic notions like bisimulation equivalence. It deals with questions of the following form: Is there a reachable state that is bisimulation equivalent to a given state ? Here we show some decidability results for process algebras and Petri nets.

Richard Mayr

[1] Javier Esparza. Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes , 1995, FCT.

[2] Faron Moller,et al. A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes , 1994, Theor. Comput. Sci..

[3] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[4] Faron Moller,et al. Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[5] Faron Moller,et al. Bisimulation Equivalence is Decidable for Basic Parallel Processes , 1993, CONCUR.

[6] Petr Jancar. Undecidability of Bisimilarity for Petri Nets and Some Related Problems , 1995, Theor. Comput. Sci..

[7] Javier Esparza,et al. Decidability of model checking for infinite-state concurrent systems , 1997, Acta Informatica.

[8] Bernhard Steffen,et al. An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes , 1995, MFCS.

[9] Faron Moller,et al. Checking Regular Properties of Petri Nets , 1995, CONCUR.