Local temporal logic is expressively complete for cograph dependence alphabets
From MaRDI portal
Publication:1763374
DOI10.1016/J.IC.2004.08.001zbMATH Open1101.68648OpenAlexW2002470885MaRDI QIDQ1763374FDOQ1763374
Authors: Volker Diekert, Paul Gastin 
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
Recommendations
Cites Work
- Graph Classes: A Survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logical definability on infinite traces
- A note on the space complexity of some decision problems for finite automata
- TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION
- LTL is expressively complete for Mazurkiewicz traces
- A \(\nu \)-calculus with local views for systems of sequential agents
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
- LATIN 2004: Theoretical Informatics
- Title not available (Why is that?)
- Local temporal logic is expressively complete for cograph dependence alphabets
- Title not available (Why is that?)
- Logics and automata for verification: Expressiveness and decidability issues
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Local temporal logic is expressively complete for cograph dependence alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763374)
