CONCUR 2003 - Concurrency Theory

DOI10.1007/b11938zbMath1195.68068OpenAlexW105220891MaRDI QIDQ5900568

Dietrich Kuske, Paul Gastin

Publication date: 30 March 2010

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

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

Mathematics Subject Classification ID

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

Related Items

Pure future local temporal logics are expressively complete for Mazurkiewicz traces ⋮ An automata-theoretic approach to constraint LTL ⋮ Propositional Dynamic Logic for Message-Passing Systems ⋮ Temporal logics for concurrent recursive programs: satisfiability and model checking ⋮ Verification of qualitative \(\mathbb Z\) constraints ⋮ From local to global temporal logics over Mazurkiewicz traces. ⋮ Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces ⋮ LTL over integer periodicity constraints