Abstract

We study the decidability of the model checking problem for linear and branching time logics, and two models of concurrent computation, namely Petri nets and Basic Parallel Processes. 1 Introduction Most techniques for the verification of concurrent systems proceed by an exhaustive traversal of the state space. Therefore, they are inherently incapable of considering systems with infinitely many states. Recently, some new methods have been developed in order to at least palliate this problem. Using them, several verification problems for some restricted infinite-state models have been shown to be decidable. These results can be classified into those showing the decidability of equivalence relations [8, 9, 24, 26], and those showing the decidability of model checking for different modal and temporal logics. In this paper, we contribute to this second group. The model checking problem has been studied so far for three infinite-state models: context-free processes, pushdown processes, and...

Citations

1085	Automatic verification of finite-state concurrent systems using temporal logic specifications - Clarke, Emerson, et al. - 1986
352	Computation: Finite and Infinite Machines - Minsky - 1967
185	Modal and Temporal Logics - Stirling - 1993
184	P.: Automata-theoretic techniques for modal logics of programs - Vardi, Wolper - 1986
182	Tree automata, mu-calculus and determinacy (extended abstract - Emerson, Jutla - 1991
155	2002, Computability and Logic - Boolos, Burgess, et al.
146	Net Theory and the Modeling of Systems - Petri - 1981
145	The temporal logic of branching time - Ben-Ari, Manna, et al. - 1981
132	An algorithm for the general Petri net reachability problem - Mayr - 1984
87	C.: Bisimulation equivalence is decidable for all context-free processes - Christensen, Hüttel, et al. - 1992
79	SuperExponential Complexity of Presburger Arithmetic - Fischer, Rabin - 1974
76	Decidability and Decomposition in Process Algebras - Christensen - 1993
74	M.: Decidability issues for Petri nets - a survey - Esparza, Nielsen - 1994
73	Local Model-Checking for Context-Free Processes - Hungar, Steffen - 1993
72	Decidability of reachability in vector addition systems - Kosaraju - 1982
71	The reachability problem requires exponential space - Lipton - 1976
50	Bisimulation equivalence is decidable for basic parallel processes - Christensen, Hirshfeld, et al. - 1993
50	Branching time temporal logic - Emerson, Srinivasan - 1989
39	nets, commutative context-free grammars, and basic parallel processes - Esparza - 1997
33	Decidability of a temporal logic problem for Petri nets - Jančar - 1990
26	Pushdown processes: Parallel composition and model checking - Burkart, Steffen - 1994
24	Petri nets and the equivalence problem - Hirshfeld - 1994
21	A unified approach for deciding the existence of certain petri net paths - Yen - 1992
20	M.: The Residue of Vector Sets with Applications to Decidability - Valk, Jantzen - 1985
19	Decidability questions for bisimilarity of Petri nets and some related problems - Jancar - 1994
18	A taxonomy of fairness and temporal logic problems for Petri nets - Howell, Rosier, et al. - 1991
17	On the Decidabilty of Model Checking for Several mu-calculi and Petri Nets - Esparza - 1994
17	Problems concerning fairness and temporal logic for conflict-free Petri net - Howell, Rosier - 1989
10	The Theory of Ends - Muller, Schupp - 1985
9	Fixpoints of Buchi automata - Dam - 1992
8	On the decidability of non-interleaving process equivalences - Kiehn, Hennessy - 1994
7	Model Checking of macro processes - Hungar - 1994
3	Bradfield: Verifying Temporal Properties of Systems. Birkhauser - C - 1991
3	Checking that finite state programs satisfy their linear specifination - Lichtenstein, Pnueli - 1985