Local temporal logic is expressively complete for cograph dependence alphabets
From MaRDI portal
Publication:1763374
DOI10.1016/J.IC.2004.08.001zbMath1101.68648OpenAlexW2002470885MaRDI QIDQ1763374
Publication date: 22 February 2005
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2004.08.001
Related Items (2)
Pure future local temporal logics are expressively complete for Mazurkiewicz traces ⋮ Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logical definability on infinite traces
- A note on the space complexity of some decision problems for finite automata
- LTL is expressively complete for Mazurkiewicz traces
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
- A ν-calculus with local views for systems of sequential agents
- Graph Classes: A Survey
- TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION
- Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
- On finite monoids having only trivial subgroups
- LATIN 2004: Theoretical Informatics
This page was built for publication: Local temporal logic is expressively complete for cograph dependence alphabets