scientific article; zbMATH DE number 2086684

MaRDI QIDQ4737221zbMATH OpenFDO

Authors Paul Gastin, Madhavan Mukund

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800938.htm

zbMATH Keywords

concurrencyMazurkiewicz tracesTemporal logics

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• LATIN 2004: Theoretical Informatics
• Pure future local temporal logics are expressively complete for Mazurkiewicz traces
• From local to global temporal logics over Mazurkiewicz traces.
• An expressively complete linear time temporal logic for Mazurkiewicz traces
• scientific article; zbMATH DE number 1670825

Cited in

(23)

• LTL is expressively complete for Mazurkiewicz traces
• Local temporal logic is expressively complete for cograph dependence alphabets
• From local to global temporal logics over Mazurkiewicz traces.
• An expressively complete linear time temporal logic for Mazurkiewicz traces
• scientific article; zbMATH DE number 1670825 (Why is no real title available?)
• Local temporal logic is expressively complete for cograph dependence alphabets
• AN EXPRESSIVE EXTENSION OF TLC
• Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
• scientific article; zbMATH DE number 4056975 (Why is no real title available?)
• scientific article; zbMATH DE number 1222573 (Why is no real title available?)
• scientific article; zbMATH DE number 1954372 (Why is no real title available?)
• scientific article; zbMATH DE number 1500557 (Why is no real title available?)
• A tableau proof system for a Mazurkiewicz trace logic with fixpoints
• scientific article; zbMATH DE number 2086683 (Why is no real title available?)
• scientific article; zbMATH DE number 1424035 (Why is no real title available?)
• Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces
• CONCUR 2005 – Concurrency Theory
• Satisfiability and model checking for MSO-definable temporal logics are in PSPACE.
• Reasoning with temporal logic on truncated paths.
• LATIN 2004: Theoretical Informatics
• Pure future local temporal logics are expressively complete for Mazurkiewicz traces
• Polynomials, fragments of temporal logic and the variety DA over traces
• Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces

This page was built for publication:

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