CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68456OpenAlexW1737342522MaRDI QIDQ5897501

Ekkart Kindler, Daniele Varacca, Hagen Völzer

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

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

Related Items

On fairness and randomness ⋮ Counterexamples in Probabilistic LTL Model Checking for Markov Chains ⋮ Model checking with fairness assumptions using PAT ⋮ On the limits of refinement-testing for model-checking CSP ⋮ Counting branches in trees using games ⋮ Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths