Complete and tractable local linear time temporal logics over traces
From MaRDI portal
Recommendations
- Mathematical Foundations of Computer Science 2003
- An elementary expressively complete temporal logic for Mazurkiewicz traces
- LATIN 2004: Theoretical Informatics
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Cited in
(15)- Finite-trace linear temporal logic: coinductive completeness
- Local temporal logic is expressively complete for cograph dependence alphabets
- Using Locales to Define a Rely-Guarantee Temporal Logic
- AN EXPRESSIVE EXTENSION OF TLC
- A -calculus with local views for systems of sequential agents
- Distributed versions of linear time temporal logic: A trace perspective
- Rules for trace consistent reasoning
- Local normal forms for logics over traces
- An expressive extension of TLC (extended abstract)
- Mathematical Foundations of Computer Science 2003
- CONCUR 2005 – Concurrency Theory
- Reasoning with temporal logic on truncated paths.
- A product version of dynamic linear time temporal logic
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces
- Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
This page was built for publication: Complete and tractable local linear time temporal logics over traces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737220)