CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452MaRDI QIDQ5897506zbMATH OpenOpenAlexFDO

Authors Paul Gastin, Dietrich Kuske

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11539452

Mathematics Subject Classification ID

Temporal logic (03B44) Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
• Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces
• scientific article; zbMATH DE number 5286865
• From local to global temporal logics over Mazurkiewicz traces.
• scientific article; zbMATH DE number 2086683
• scientific article; zbMATH DE number 2086684
• scientific article; zbMATH DE number 1059327
• scientific article; zbMATH DE number 1114033
• Pure future local temporal logics are expressively complete for Mazurkiewicz traces
• LATIN 2004: Theoretical Informatics

Cited in

(4)

• The complexity of model checking multi-stack systems
• Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces
• Satisfiability and model checking for MSO-definable temporal logics are in PSPACE.
• Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces

This page was built for publication: CONCUR 2005 – Concurrency Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897506)