Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Interleaving set temporal logic
Theoretical Computer Science
On undecidability of propositional temporal logics on trace systems
Information Processing Letters
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
The Book of Traces
LTL Is Expressively Complete for Mazurkiewicz Traces
ICALP '00 Proceedings of the 27th 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
Difficult Configurations - On the Complexity of LTrL
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Concurrent Branching Time Temporal Logic
CSL '89 Proceedings of the 3rd Workshop on Computer Science Logic
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
Model-Checking of causality properties
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
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
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
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 |
We study the complexity of temporal logics over concurrent systems that can be described by Mazurkiewicz traces. We develop a general method to prove that the uniform satisfiability problem of local temporal logics is in PSPACE. We also demonstrate that this method applies to all known local temporal logics.