Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Linear Time Temporal Logics over Mazurkiewicz Traces
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations 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
A Trace Consistent Subset of PTL
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Algorithmic Verification of Linear Temporal Logic Specifications
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The monadic quantifier alternation hierarchy over grids and graphs
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
Difficult Configurations—On the Complexity of LTrL
Formal Methods in System Design
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
CONCUR 2005 - Concurrency Theory
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
Temporal logics for concurrent recursive programs: satisfiability and model checking
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The Complexity of Model Checking Multi-stack Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Building Occurrence Nets from Reveals Relations
Fundamenta Informaticae
| Hi-index | 0.00 |
We continue our study of the complexity of MSO-definable local temporal logics over concurrent systems that can be described by Mazurkiewicz traces. In previous papers, we showed that the satisfiability problem for any such logic is in PSPACE (provided the dependence alphabet is fixed, Gastin and Kuske (2003) [10]) and remains in PSPACE for all classical local temporal logics even if the dependence alphabet is part of the input, Gastin and Kuske (2007) [8]. In this paper, we consider the uniform satisfiability problem for arbitrary MSO-definable local temporal logics. For this problem, we prove multi-exponential lower and upper bounds that depend on the number of alternations of set quantifiers present in the chosen MSO-modalities.