Automata, Languages and Programming
From MaRDI portal
Publication:5716822
DOI10.1007/11523468zbMath1084.68085OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716822
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (6)
New up-to techniques for weak bisimulation ⋮ An efficient abstract machine for safe ambients ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Using bisimulation proof techniques for the analysis of distributed abstract machines ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
This page was built for publication: Automata, Languages and Programming
