The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Specification and verification of concurrent programs by A∀automata
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
ACM Transactions on Programming Languages and Systems (TOPLAS)
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Reasoning about infinite computations
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters
Expressive Completeness of Temporal Logic of Action
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
An improvement in formal verification
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
An Abort-Aware Model of Transactional Programming
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Specification Languages for Stutter-Invariant Regular Properties
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Compositional verification with stutter-invariant propositional projection temporal logic
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Self-loop aggregation product: a new hybrid approach to on-the-fly LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Hi-index | 0.00 |
Temporal logic and ω-automata are two ofthe common frameworks for specifying properties of reactive systems in modern verification tools. In this paper we unify these two frameworks in the linear time setting for the specification of stutter-invariant properties, which are used in the context of partial-order verification. We will observe a simple variant of linear time propositional temporal logic (LTL) for expressing exactly the stutter-invariant ω-regular languages. The complexity of, and algorithms for, all the relevant decision procedures for this logic remain essentially the same as with ordinary LTL. In particular, satisfiability remains PSPACE-complete and temporal formulas can be converted to at most exponential sized ω-automata. More importantly, we show that the improved practical algorithms for conversion of LTL formulas to automata, used in model-checking tools such as SPIN, which typically produce much smaller than worst-case output, can be modified to incorporate this extension to LTL with the same benefits. In this way, the specification mechanism in temporal logic-based tools that employ partial-order reduction can be extended to incorporate all stutter-invariant ω-regular properties.