Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A really abstract concurrent model and its temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Augmenting a regular expression-based temporal logic with local variables
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
On Regular Temporal Logics with Past,
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Specification Languages for Stutter-Invariant Regular Properties
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
The theory and practice of SALT
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Alternation elimination for automata over nested words
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Formalizing requirements with object models and temporal constraints
Software and Systems Modeling (SoSyM)
Size-change termination and satisfiability for linear-time temporal logics
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Regular linear temporal logic with past
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular in Accelera's Property Specification Language. We obtain results about the expressive power of fragments of this logic when restricted to certain operators only: basically, all operators alone suffice for expressive completeness w.r.t. ω-regular expressions, just the closure operator is too weak. We also obtain complexity results. Again, almost all operators alone suffice for EXPSPACE completeness, just the closure operator needs some help.