CONCUR 2005 – Concurrency Theory
From MaRDI portal
Publication:5897481
DOI10.1007/11539452zbMath1134.68351OpenAlexW1737342522MaRDI QIDQ5897481
Andrzej S. Murawski, Joël Ouaknine
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
Randomized algorithms (68W20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (9)
Verifying annotated program families using symbolic game semantics ⋮ Program equivalence in a typed probabilistic call-by-need functional language ⋮ Three tokens in Herman's algorithm ⋮ Unnamed Item ⋮ Program verification using symbolic game semantics ⋮ On the hardness of analyzing probabilistic programs ⋮ Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties ⋮ Algorithmic probabilistic game semantics. Playing games with automata ⋮ Unnamed Item
This page was built for publication: CONCUR 2005 – Concurrency Theory
