Abstract
We investigate the model checking problem for branching time logics and Basic Parallel Processes. We show that the problem is undecidable for the logic ∀L(O, F, U) (equivalent to CTL *) in the usual interleaving semantics, but decidable in a standard partial order interpretation.
This work was partially done within the Sonderforschungsbereich 342 WG A3: SAM
Chapter PDF
References
J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Computation 60:109–137, 1984.
O. Burkart and B. Steffen. Model checking for context-free processes. In Proceedings of CONCUR '92, LNCS 630:123–137, 1992.
S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation Equivalence is Decidable for all Basic Parallel Processes. In Proceedings of CONCUR '93, LNCS 715:143–157, 1993.
S. Christensen, H. Hüttel, and C. Stirling. Bisimulation Equivalence is Decidable for all Context-free Processes. In Proceedings of CONCUR '92, LNCS 630:138–147, 1992.
E.M. Clarke and E.A. Emerson. Design and Synthesis of synchronization skeletons using Branching Time Temporal Logic. In Proceedings of Workshop on Logics of Programs, LNCS 131:52–71, 1981.
E.A. Emerson. Temporal and Modal Logic. In Handbook of Theoretical Computer Science, Volume B, 995–1072, 1990.
E.A. Emerson and J.Y. Halpern. “Sometimes” and “Not Never” revisited: on Branching versus Linear Time Temporal Logic. Journal of the ACM 33(1):151–178, 1986.
E.A. Emerson and C. S. Jutla. Tree Automata, Mu-Calculus and Determinacy. In Proceedings of FOCS '91, 1991.
J. Engelfriet. Branching processes of Petri nets. Acta Informatica 28:575–591, 1991.
J. Esparza. On the Decidability of the Model Checking Problem for Several μcalculi and Petri Nets. In Proceedings of CAAP '94, LNCS 787:115–129, 1994.
J. Esparza. On the uniform word problem for commutative context-free grammars. Submitted for publication, 1994.
R. Gorrieri and U. Montanari. A Simple Calculus of Nets. In Proceedings of CONCUR '90, LNCS 458:2–30, 1990.
Y. Hirshfeld. Petri Nets and the Equivalence Problem. In Proceedings of CSL '93, 1994.
H. Hungar and B. Steffen. Local Model Checking for Context-Free Processes. In Proceedings of ICALP '93, LNCS 707, 1993.
D. Muller and P. Schupp. The Theory of Ends, Pushdown Automata and Second Order Logic, Theoretical Computer Science 37: 51–75, 1985.
M. Minsky: Computation. Finite and Infinite Machines. Prentice-Hall, 1967.
D. Peled, S. Katz, and A. Pnueli. Specifying and Proving Serializability in Temporal Logic. In Proceedings of LICS '91, 232–245, 1991.
W. Penczek. Temporal Logics for Trace Systems: On Automated Verification. International Journal on Foundations of Computer Science 33:31–67, 1992.
M.O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141:1–35, 1969.
C. Stirling. Modal and Temporal Logics. In Handbook of Logic in Computer Science, Oxford University Press, 1991.
P.S. Thiagarajan. A Trace Based Extension of PTL. In Proceedings of LICS '94, 1994.
P. Wolper. Temporal Logic can be more expressive. Information and Control 56(1,2):72–93, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Esparza, J., Kiehn, A. (1995). On the model checking problem for branching time logics and basic parallel processes. In: Wolper, P. (eds) Computer Aided Verification. CAV 1995. Lecture Notes in Computer Science, vol 939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60045-0_62
Download citation
DOI: https://doi.org/10.1007/3-540-60045-0_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60045-9
Online ISBN: 978-3-540-49413-3
eBook Packages: Springer Book Archive