CONCUR 2005 – Concurrency Theory
From MaRDI portal
Publication:5897497
DOI10.1007/11539452zbMath1134.68432MaRDI QIDQ5897497
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
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Control Flow Analysis for Brane Calculi, Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications, Operational Semantics of Reversibility in Process Algebra, Control Flow Analysis of Generalised Boolean Networks, An Observational Model for Transactional Calculus of Services Orchestration, Reversibility in the higher-order \(\pi\)-calculus, Contextual equivalences in configuration structures and reversibility, Reversible session-based pi-calculus, Causal-consistent rollback in a tuple-based language, Reversibility and asymmetric conflict in event structures, Distinguishing between communicating transactions, A theory of reversibility for Erlang, An axiomatic approach to reversible computation, Specifying reversibility with \(\mathrm{TLA}^+\), A parametric framework for reversible \(\pi\)-calculi, A control flow analysis for Beta-binders with and without static compartments, Reversibility in session-based concurrency: a fresh look, Verifying chemical reaction network implementations: a pathway decomposition approach, Reversing algebraic process calculi, Self-assembling Trees, General Reversibility, A Static Analysis for Beta-Binders, Controlling Reversibility in Higher-Order Pi, Static VS Dynamic Reversibility in CCS, Reversing Single Sessions, Reversible Computation vs. Reversibility in Petri Nets
