The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
IEEE Spectrum
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
The complexity of propositional linear temporal logics in simple cases
Information and Computation
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Two variable vs. linear temporal logic in model checking and games
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
| Hi-index | 0.00 |
Recursive state machines (RSMS) are models for programs with recursive procedural calls. While Ltl model-checking is Exptimecomplete on such models, on finite-state machines, it is Pspace-complete in general and becomes NP-complete for interesting fragments. In this paper, we systematically study the computational complexity of modelchecking RSMS against several syntactic fragments of LTL. Our main result shows that if in the specification we disallow next and until, and retain only the box and diamond operators, model-checking is in NP. Thus, differently from the full logic, for this fragment the abstract complexity of model-checking does not change moving from finite-state machines to RSMS. Our results on the other studied fragments confirm this trend, in the sense that, moving from finite-state machines to RSMS, the complexity of model-checking either rises from PSPACE-complete to EXPTIMECOMPLETE, or stays within NP.