CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.68066MaRDI QIDQ5311480

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100113

Mathematics Subject Classification ID

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

Related Items

Applying Reversibility Theory for the Performance Evaluation of Reversible Computations, Proof-relevant π-calculus: a constructive account of concurrency and causality, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs, Investigating Reversibility of Steps in Petri Nets, Towards Bridging Time and Causal Reversibility, Causal-Consistent Debugging of Distributed Erlang Programs, Towards a Truly Concurrent Semantics for Reversible CCS, Forward-Reverse Observational Equivalences in CCSK, Explicit Identifiers and Contexts in Reversible Concurrent Calculus, Characterizing Compatible View Updates in Syntactic Bidirectionalization, Reversible Imperative Parallel Programs and Debugging, Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications, Concurrent Reversible Sessions, Operational Semantics of Reversibility in Process Algebra, Event structure semantics of (controlled) reversible CCS, Event structures for the reversible early internal $\pi$-calculus, Unnamed Item, Reverse bisimilarity vs. forward bisimilarity, Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach, Reversing Steps in Petri Nets, Reversing Unbounded Petri Nets, Replications in reversible concurrent calculi, Towards a taxonomy for reversible computation approaches, Implementation of a reversible distributed calculus, revTPL: The Reversible Temporal Process Language, Reversible debugging of concurrent Erlang programs: supporting imperative primitives, Reversibility in the higher-order $\pi$-calculus, Reversible client/server interactions, Contextual equivalences in configuration structures and reversibility, Reversible session-based pi-calculus, Emergence of universal global behavior from reversible local transitions in asynchronous systems, Causal-consistent rollback in a tuple-based language, On the hierarchy of d-structures, Reversibility and asymmetric conflict in event structures, Fundamentals of reversible flowchart languages, A theory of reversibility for Erlang, Mutual exclusion and reversibility in reaction systems, Simulating reversible computation with reaction systems, Reversible computation in nature inspired rule-based systems, Static versus dynamic reversibility in CCS, Processes against tests: on defining contextual equivalences, Concurrencies in reversible concurrent calculi, Reversibility in Erlang: imperative constructs, Towards causal-consistent reversibility of imperative concurrent programs, From reversible programs to univalent universes and back, Modelling of DNA mismatch repair with a reversible process calculus, Controlled reversibility in communicating reaction systems, The reversible temporal process language, An axiomatic approach to reversible computation, Specifying reversibility with $\mathrm{TLA}^+$, A parametric framework for reversible $\pi$-calculi, Reversible sessions with flexible choices, Relational presheaves, change of base and weak simulation, Reversibility in session-based concurrency: a fresh look, Towards a categorical representation of reversible event structures, Reversing algebraic process calculi, Reversible computation in nets with bonds, A collective interpretation semantics for reversing Petri nets, Towards Modelling of Local Reversibility, Self-assembling Trees, General Reversibility, Reversibility and Models for Concurrency, Quantitative Analysis of Concurrent Reversible Computations, Controlling Reversibility in Higher-Order Pi, Rigid Families for the Reversible $$\pi $$ -Calculus, A Calculus for Local Reversibility, Static VS Dynamic Reversibility in CCS, Reversing Single Sessions, Reversible Computation vs. Reversibility in Petri Nets, Unnamed Item, Unnamed Item, Event-Based Service Coordination, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra