On the Decidability of Model Checking for Several µ-calculi and Petri Nets

The decidability of the model checking problem for several μ-calculi and Petri nets is analysed. The linear time μ-calculus without atomic sentences is decidable; if simple atomic sentences are added, it becomes undecidable. A very simple subset of the modal μ-calculus is undecidable.

[1]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[2]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[3]  Hsu-Chun Yen,et al.  A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets , 1991, Theor. Comput. Sci..

[4]  Hsu-Chun Yen,et al.  A Unified Approach for Deciding the Existence of Certain Petri Net Paths , 1992, Inf. Comput..

[5]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[6]  Julian Bradfield.  Verifying Temporal Properties of Systems , 1992, Progress in Theoretical Computer Science.

[7]  James L. Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[8]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

[9]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[10]  Rüdiger Valk,et al.  The residue of vector sets with applications to decidability problems in Petri nets , 1985, Acta Informatica.

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

[12]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[13]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[14]  Petr Jancar,et al.  Decidability of a Temporal Logic Problem for Petri Nets , 1990, Theor. Comput. Sci..

[15]  Hsu-Chun Yen,et al.  A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets , 1988, Theor. Comput. Sci..

[16]  Rodney R. Howell,et al.  Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets , 1989, Theor. Comput. Sci..