Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra

DOI10.1007/978-3-540-68679-8_47zbMath1143.68475OpenAlexW1506203320MaRDI QIDQ3507401

Ilaria Castellani, Glynn Winskel, Mogens Nielsen, Gérard Boudol, Matthew C. B. Hennessy

Publication date: 19 June 2008

Published in: Concurrency, Graphs and Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68679-8_47

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Location equivalence in a parametric setting
• Universal axioms for bisimulations
• Observing localities
• Refinement of actions in event structures and causal trees
• A\(^ 2\)CCS: Atomic actions for CCS
• A partial ordering semantics for CCS
• Transactions on Computational Systems Biology VI
• Petri nets with individual tokens
• Concurrent histories: a basis for observing distributed systems
• Bisimulations and abstraction homomorphisms
• Modeling concurrency with partial orders
• Petri nets, algebras, morphisms, and compositionality
• A distributed operational semantics of CCS based on condition/event systems
• Concurrency and atomicity
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Elementary transition systems
• The chemical abstract machine
• A theory of processes with localities
• A static view of localities
• Flow models of distributed computations: Three equivalent semantics for CCS
• Comparing locality and causality based equivalences
• Adding action refinement to a finite process algebra
• Testing equivalences for processes
• Locality based semantics for process algebras
• Parallel product of event structures
• Mobile ambients
• Well-behaved flow event structures for parallel composition and action refinement
• Transition systems, event structures, and unfoldings
• Seminar on concurrency, Carnegie-Mellon University, Pittsburgh, PA, July 9-11, 1984
• Towards action-refinement in process algebras
• Reversibility and Models for Concurrency
• TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING
• A Distributed Pi-Calculus
• Distributed bisimulations
• Symmetry and Concurrency
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• Axiomatising Finite Concurrent Processes
• OBSERVING DISTRIBUTION IN PROCESSES: STATIC AND DYNAMIC LOCALITIES
• A parametric approach to localities
• Proved trees
• CONCUR 2004 - Concurrency Theory
• Profunctors, open maps and bisimulation
• Connections between a concrete and an abstract model of concurrent systems
• Refinement of actions and equivalence notions for concurrent systems