Publication:4945225

zbMath0942.03028MaRDI QIDQ4945225

Volker Diekert, Paul Gastin

Publication date: 23 August 2000

zbMATH Keywords

expressive completeness; concurrency; Mazurkiewicz traces; linear time temporal logic; future tense modalities; model of concurrent systems

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

03B44: Temporal logic

Related Items

LTL is expressively complete for Mazurkiewicz traces, The complexity of propositional linear temporal logics in simple cases