CONCUR 2005 – Concurrency Theory
From MaRDI portal
Publication:5897497
DOI10.1007/11539452zbMath1134.68432OpenAlexW1737342522MaRDI 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
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 (46)
Reversibility in the higher-order \(\pi\)-calculus ⋮ Reversibility in session-based concurrency: a fresh look ⋮ Towards Bridging Time and Causal Reversibility ⋮ Static VS Dynamic Reversibility in CCS ⋮ Reversing Single Sessions ⋮ Reversible Computation vs. Reversibility in Petri Nets ⋮ Reversing algebraic process calculi ⋮ Contextual equivalences in configuration structures and reversibility ⋮ Reversible computation in nets with bonds ⋮ A collective interpretation semantics for reversing Petri nets ⋮ Reversibility and asymmetric conflict in event structures ⋮ Verifying chemical reaction network implementations: a pathway decomposition approach ⋮ Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach ⋮ Reversing Steps in Petri Nets ⋮ Towards a taxonomy for reversible computation approaches ⋮ On the Introduction of Guarded Lists in Bach: Expressiveness, Correctness, and Efficiency Issues ⋮ An axiomatic approach to reversible computation ⋮ Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures ⋮ Distinguishing between communicating transactions ⋮ Specifying reversibility with \(\mathrm{TLA}^+\) ⋮ Unnamed Item ⋮ A parametric framework for reversible \(\pi\)-calculi ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reversible session-based pi-calculus ⋮ Simulating reversible computation with reaction systems ⋮ Control Flow Analysis of Generalised Boolean Networks ⋮ Causal-consistent rollback in a tuple-based language ⋮ Explicit Identifiers and Contexts in Reversible Concurrent Calculus ⋮ Control Flow Analysis for Brane Calculi ⋮ A control flow analysis for Beta-binders with and without static compartments ⋮ Static versus dynamic reversibility in CCS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A theory of reversibility for Erlang ⋮ Event structure semantics of (controlled) reversible CCS ⋮ Controlling Reversibility in Higher-Order Pi ⋮ Unnamed Item ⋮ Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications ⋮ A Petri net view of covalent bonds ⋮ An Observational Model for Transactional Calculus of Services Orchestration ⋮ Self-assembling Trees ⋮ General Reversibility ⋮ Operational Semantics of Reversibility in Process Algebra ⋮ A Static Analysis for Beta-Binders ⋮ Investigating Reversibility of Steps in Petri Nets
This page was built for publication: CONCUR 2005 – Concurrency Theory
