The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Languages, automata, and logic
Handbook of formal languages, vol. 3
The Book of Traces
Linear Time Temporal Logics over Mazurkiewicz Traces
MFCS '96 Proceedings of the 21st 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
Logical Definability on Infinite Traces
ICALP '93 Proceedings of the 20th 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
An Exprssively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Keeping track of the latest gossip in a distributed system
Distributed Computing
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Tight bounds on the complexity of cascaded decomposition of automata
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Local Normal Forms for Logics over Traces
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical 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
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
| Hi-index | 0.00 |
We present the first expressively complete and yet tractable temporal logics, Past-TrLTL and TrLTL, to reason about distributed behaviours, modelled as Mazurkiewicz traces. Both logics admit singly exponential automata-theoretic decision procedures. General formulas of Past-TrLTL are boolean combinations of local formulas which assert rich properties of local histories of the behaviours. Past-TrLTL has the same expressive power as the first order theory of finite traces. TrLTL provides formulas to reason about recurring local Past-TrLTL properties and equals the complete first order theory in expressivity. The expressive completeness criteria are based on new local normal forms for the first order logic. We illustrate the use of our logics for specification of global properties.