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
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
An Expressive Extension of TLC
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Difficult Configurations - On the Complexity of LTrL
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and 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
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
Complete and Tractable Local Linear Time Temporal Logics over Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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 |
Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in the word case. If we focus on a purely local interpretation of formulae at vertices (or events) of a trace, then the satisfiability problem of linear temporal logics over traces turns out to be PSPACE-complete. But now the difficult problem is to obtain expressive completeness results with respect to first order logic. The main result of the paper shows such an expressive completeness result, if the underlying dependence alphabet is a cograph, i.e., if all traces are series parallel graphs. Moreover, we show that this is the best we can expect in our setting: If the dependence alphabet is not a cograph, then we cannot express all first order properties.