From local to global temporal logics over Mazurkiewicz traces.

DOI10.1016/J.TCS.2006.01.035MaRDI QIDQ2490814zbMATH OpenOpenAlexFDO

Authors Volker Diekert, Paul Gastin

Publication date 18 May 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.01.035

zbMATH Keywords

concurrencyMazurkiewicz tracestemporal logics

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• LATIN 2004: Theoretical Informatics
• Pure future local temporal logics are expressively complete for Mazurkiewicz traces
• scientific article; zbMATH DE number 2086684
• scientific article; zbMATH DE number 1114033
• Mathematical Foundations of Computer Science 2003

Cites work

• A -calculus with local views for systems of sequential agents
• A remark on the representation of trace monoids
• An expressively complete linear time temporal logic for Mazurkiewicz traces
• Determinants and Möbius functions in trace monoids
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 4031964 (Why is no real title available?)
• scientific article; zbMATH DE number 1223711 (Why is no real title available?)
• scientific article; zbMATH DE number 1114033 (Why is no real title available?)
• scientific article; zbMATH DE number 2087486 (Why is no real title available?)
• scientific article; zbMATH DE number 1916675 (Why is no real title available?)
• LATIN 2004: Theoretical Informatics
• Logical definability of some rational trace languages
• Logical definability on infinite traces
• LTL is expressively complete for Mazurkiewicz traces
• On the starheight of some rational subsets closed under partial commutations
• Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
• Satisfiability and model checking for MSO-definable temporal logics are in PSPACE.
• Star-free trace languages
• TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION

Cited in

(6)

• Computing the reveals relation in occurrence nets
• scientific article; zbMATH DE number 1954372 (Why is no real title available?)
• scientific article; zbMATH DE number 2086684 (Why is no real title available?)
• CONCUR 2005 – Concurrency Theory
• LATIN 2004: Theoretical Informatics
• Pure future local temporal logics are expressively complete for Mazurkiewicz traces

This page was built for publication: From local to global temporal logics over Mazurkiewicz traces.

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