A hierarchy of equivalences for asynchronous calculi

DOI10.1016/j.jlap.2004.01.006zbMath1066.68088OpenAlexW1999810324MaRDI QIDQ1772314

Georges Gonthier, Cédric Fournet

Publication date: 18 April 2005

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2004.01.006

zbMATH Keywords

ConcurrencyProcess calculiAsynchronous \(\pi\)-calculusBarbed bisimulationCoupled simulationFair testingJoin calculusMay testingObservational equivalenceReduction equivalence

Mathematics Subject Classification ID

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

Related Items (15)

Fair testing ⋮ Coupled similarity: the first 32 years ⋮ Virtually timed ambients: a calculus of nested virtualization ⋮ Complete Lattices and Up-To Techniques ⋮ Exploring probabilistic bisimulations. I ⋮ More on bisimulations for higher order \(\pi\)-calculus ⋮ Observing Success in the Pi-Calculus ⋮ Structural Rewriting in the pi-Calculus. ⋮ On the Semantics of Markov Automata ⋮ Full abstraction for polymorphic \(\pi \)-calculus ⋮ Concurrency cannot be observed, asynchronously ⋮ Relating reasoning methodologies in linear logic and process algebra ⋮ Event based choreography ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Processes against tests: on defining contextual equivalences

Cites Work

• A calculus of communicating systems
• On bisimulations for the asynchronous \(\pi\)-calculus
• Testing equivalences for processes
• On reduction-based process semantics
• Decoding choice encodings
• Secure implementation of channel abstractions
• Testing equivalence for mobile processes
• A theory of bisimulation for the \(\pi\)-calculus
• On the bisimulation proof method
• A foundation for actor computation
• Divergence and fair testing
• Authentication primitives and their compilation
• Mobile values, new names, and secure communication
• Barbed bisimulation
• Bisimulations in the join-calculus
• Reasoning about cryptographic protocols in the spi calculus
• Implicit typing à la ML for the join-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A hierarchy of equivalences for asynchronous calculi