On the Complexity of Ltl Model-Checking of Recursive State Machines
Authors:
- 1 January 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 937-948
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Analysis of recursive state machinesACM Transactions on Programming Languages and Systems, 2005
- A Temporal Logic of Nested Calls and Returns2004
- Embedded Software2003
- The Complexity of Propositional Linear Temporal Logics in Simple CasesInformation and Computation, 2002
- Efficient Algorithms for Model Checking Pushdown Systems2000
- The model checker SPINIEEE Transactions on Software Engineering, 1997
- Reachability analysis of pushdown automata: Application to model-checking1997
- Computer-aided verificationIEEE Spectrum, 1996
- Temporal and Modal Logic1990
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985