Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
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
LTL is expressively complete for Mazurkiewicz traces
Journal of Computer and System Sciences
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
LTL Is Expressively Complete for Mazurkiewicz Traces
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Difficult Configurations - On the Complexity of LTrL
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
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
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
Classifying discrete temporal properties
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A Logical Model for Coordination Rule Classes in Collaborative Sessions
WETICE '03 Proceedings of the Twelfth International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
CONCUR 2005 - Concurrency Theory
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
Polynomials, fragments of temporal logic and the variety DA over traces
Theoretical Computer Science
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
Information and Computation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Polynomials, fragments of temporal logic and the variety DA over traces
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
In contrast to the classical setting of sequences, no temporal logic has yet been identified over Mazurkiewicz traces that is equivalent to first-order logic over traces and yet admits an elementary decision procedure. In this paper, we describe a local temporal logic over traces that is expressively complete and whose satisfiability problem is in Pspace. Contrary to the situation for sequences, past modalities are essential for such a logic. A somewhat unexpected corollary is that first-order logic with three variables is expressively complete for traces.