CONCUR 2004 - Concurrency Theory
From MaRDI portal
Publication:5311480
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
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, Operational Semantics of Reversibility in Process Algebra, 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, 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, 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, Event-Based Service Coordination, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
