Complexity results on branching-time pushdown model checking

Theoretical Computer Science

Volumn 379, Issue 1-2, 2007, Pages 286-297

  Bozzelli, Laura ^a  

^a CNRS   (France)

Author keywords

Infinite state systems; Model checking; Pushdown systems; Regular propositional temporal logics

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; DIFFERENTIATION (CALCULUS); PROBLEM SOLVING;

INFINITE STATE SYSTEMS; PUSHDOWN SYSTEMS; REGULAR PROPOSITIONAL TEMPORAL LOGICS;

MODEL CHECKING;

EID: 34248182568     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.03.049     Document Type: Article

References (25)

1. Bouajjani A., Esparza J., and Maler O. Reachability analysis of pushdown automata: Application to model-checking. Proc. 8th International Conference on Concurrency Theory, CONCUR'97. LNCS vol. 1243 (1997), Springer-Verlag 135-150
2. Burkart O., and Steffen B. Composition, decomposition and model checking of pushdown processes. Nordic Journal of Computing 2 2 (1995) 89-125
3. Caucal D. On infinite transition graphs having a decidable monadic theory. Proc. 23th International Colloquium on Automata, Languages and Programming, ICALP'96. LNCS vol. 1099 (1996), Springer-Verlag 194-205
4. Chandra A.K., Kozen D.C., and Stockmeyer L.J. Alternation. Journal of the ACM 28 1 (1981) 114-133
5. Clarke E.M., and Emerson E.A. Design and verification of synchronization skeletons using branching time temporal logic. Proceedings of Workshop on Logic of Programs. LNCS vol. 131 (1981), Springer-Verlag 52-71
6. Clarke E.M., Emerson E.A., and Sistla A.P. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8 2 (1986) 244-263
7. Emerson E.A., and Clarke E.M. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming 2 3 (1982) 241-266
8. Emerson E.A., and Halpern J.Y. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM 33 1 (1986) 151-178
9. Emerson E.A., and Jutla C.S. The complexity of tree automata and logics of programs. 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (1988) 328-337
10. Emerson E.A., and Jutla C.S. Tree automata, μ-calculus and determinacy. 32nd Annual IEEE Symposium on the Foundations of Computer Science, FOCS'91 (1991) 368-377
11. Esparza J., Hansel D., Rossmanith P., and Schwoon S. Efficient algorithms for model checking pushdown systems. Proc. 12th International Conference on Computer Aided Verification, CAV'00. LNCS vol. 1855 (2000), Springer-Verlag 232-247
12. Esparza J., Kucera A., and Schwoon S. Model checking LTL with regular valuations for pushdown systems. Information and Computation 186 2 (2003) 355-376
13. Finkel A., Willems B., and Wolper P. A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science 9 (1997)
14. Kupferman O., Piterman N., and Vardi M.Y. Pushdown specifications. 9th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR'02. LNAI vol. 2514 (2002), Springer-Verlag 262-277
15. Kupferman O., Thiagarajan P.S., Madhusudan P., and Vardi M.Y. Open systems in reactive environments: Control and synthesis. Proc. 11th International Conference on Concurrency Theory, CONCUR'00. LNCS vol. 1877 (2000), Springer-Verlag 92-107
16. Kupferman O., Vardi M.Y., and Wolper P. An Automata-Theoretic Approach to Branching-Time Model Checking. Journal of the ACM 47 2 (2000) 312-360
17. Muller D.E., and Shupp P.E. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science 37 (1985) 51-75
18. Muller D.E., and Shupp P.E. Alternating automata on infinite trees. Theoretical Computer Science 54 (1987) 267-276
19. Piterman N., and Vardi M.Y. Global model-checking of infinite-state systems. Proc. 16th International Conference on Computer Aided Verification, CAV'04. LNCS vol. 3114 (2004), Springer-Verlag 387-400
20. Sistla A.P., and Clarke E.M. The complexity of propositional linear temporal logics. Journal of the ACM 32 3 (1985) 733-749
21. Vardi M.Y. A temporal fixpoint calculus. 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'88 (1988), ACM Press 250-259
22. Vardi M.Y. Reasoning about the past with two-way automata. Proc. 25th International Colloquium on Automata, Languages and Programming, ICALP'98. LNCS vol. 1443 (1998), Springer-Verlag 628-641
23. Vardi M.Y., and Stockmeyer L.J. Improved upper and lower bounds for modal logics of programs. 17th Annual ACM Symposium on Theory of Computing, STOC'85 (1985) 240-251
24. Walukiewicz I. Pushdown processes: Games and Model Checking. Proc. 8th International Conference on Computer Aided Verification, CAV'96. LNCS vol. 1102 (1996), Springer-Verlag 62-74
25. Walukiewicz I. Model checking CTL properties of pushdown systems. Proc. 20th Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS'00. LNCS vol. 1974 (2000), Springer-Verlag 127-138