CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68436OpenAlexW1737342522MaRDI QIDQ5897506

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

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

Related Items (2)

The complexity of model checking multi-stack systems ⋮ Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces

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