The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Handbook of theoretical computer science (vol. B)
The complexity of probabilistic verification
Journal of the ACM (JACM)
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Automatic Verification of Probabilistic Free Choice
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Local Liveness for Compositional Modeling of Fair Reactive Systems
Proceedings of the 7th International Conference on Computer Aided Verification
CONCUR 2005 - Concurrency Theory
Temporal Logics and Model Checking for Fairly Correct Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Fair adversaries and randomization in two-player games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
Hi-index | 0.00 |
We compare the complexities of the following two model checking problems: checking whether a linear-time formula is satisfied by all paths (which we call universal model checking) and checking whether a formula is satisfied by almost all paths (which we call fair model checking here). For many interesting classes of linear-time formulas, both problems have the same complexity: for instance, they are PSPACE-complete for LTL. In this paper, we show that fair model checking can have lower complexity than universal model checking, viz., we prove that fair model checking for L(F∞) can be done in time linear in the size of the formula and of the system, while it is known that universal model checking for L(F∞) is co-NP-complete. L(F∞) denotes the class of LTL formulas in which (F∞) is the only temporal operator. We also present other new results on the complexity of fair and universal model checking. In particular, we prove that fair model checking for RLTL is co-NP-complete.