Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
The Book of Traces
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A v-Calculus with Local Views for Systems of Sequential Agents
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Linear Time Temporal Logics over Mazurkiewicz Traces
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
A (Non-elementary) Modular Decision Procedure for LTrL
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Difficult Configurations - On the Complexity of LTrL
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Trace Consistent Subset of PTL
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Safety and liveness properties for real traces and a direct translation from LTL to monoids
Formal and natural computing
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
Classifying discrete temporal properties
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
From local to global temporal logics over Mazurkiewicz traces
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Testing Distributed Systems Through Symbolic Model Checking
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Realizability of Concurrent Recursive Programs
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Truly Concurrent Logic via In-Between Specification
Electronic Notes in Theoretical Computer Science (ENTCS)
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation
On first-order fragments for words and Mazurkiewicz traces: a survey
DLT'07 Proceedings of the 11th international conference on Developments in language theory
FM'06 Proceedings of the 14th international conference on Formal Methods
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
A long standing open problem in the theory of (Mazurkiewicz) traces has been the question whether LTL (linear temporal logic) is expressively complete with respect to the first order theory. We solve this problem positively for finite and infinite traces and for the simplest temporal logic, which is based only on next and until modalities. Similar results were established previously, but they were all weaker, since they used additional past or future modalities. Another feature of our work is that our proof is direct and does not use any reduction to the word case.