The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
On undecidability of propositional temporal logics on trace systems
Information Processing Letters
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Proving partial order properties
Theoretical Computer Science
A logical study of distributed transition systems
Information and Computation
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
The Book of Traces
Partial Order Reduction: Model-Checking Using Representatives
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Logical Definability on Infinite Traces
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Deciding Global Partial-Order Properties
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Model-Checking of causality properties
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Locally linear time temporal logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
An Exprssively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
Information and Computation
| Hi-index | 0.00 |
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also called configuration. The logic is shown to be non-elementary with the main reason for this complexity being the nesting of until operators in formulas. The fragment of the logic without the until operator is shown to be EXPSPACE-hard.