The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
A Polynomial time Algorithm for the Local Testability Problem of Deterministic Finite Automata
IEEE Transactions on Computers
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
Reasoning about infinite computations
Information and Computation
Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters
An Until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
Information and Computation - Special issue: LICS 1996—Part 1
A note on a question of Peled and Wilke regarding stutter-invariant LTL
Information Processing Letters
Recent Results on Automata and Infinite Words
Proceedings of the Mathematical Foundations of Computer Science 1984
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
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Theoretical Computer Science - Latin American theoretical informatics
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Fragments of First-Order Logic over Infinite Words
Theory of Computing Systems
| Hi-index | 0.00 |
We present a framework for obtaining effective characterizations of simple fragments of future temporal logic (LTL) with the natural numbers as time domain. The framework is based on prophetic automata (also known as complete unambiguous Büchi automata), which enjoy strong structural properties, in particular, they separate the "finitary fraction" of a regular language of infinite words from its "infinitary fraction" in a natural fashion. Within our framework, we provide characterizations of all natural fragments of temporal logic, where, in some cases, no effective characterization had been known previously, and give lower and upper bounds for their computational complexity.