On bisimulations for the asynchronous \(\pi\)-calculus
From MaRDI portal
Publication:1276246
DOI10.1016/S0304-3975(97)00223-5zbMath0915.68009OpenAlexW1487583155MaRDI QIDQ1276246
Roberto M. Amadio, Davide Sangiorgi, Ilaria Castellani
Publication date: 20 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00223-5
Related Items (53)
Coalgebraic Symbolic Semantics ⋮ Tau laws for pi calculus ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ A synchronous \(\pi\)-calculus ⋮ Asynchronous Traces and Open Petri Nets ⋮ Encoding Asynchronous Interactions Using Open Petri Nets ⋮ Basic observables for a calculus for global computing ⋮ Linear forwarders ⋮ The SL synchronous language, revisited ⋮ Coupled similarity: the first 32 years ⋮ A General Theory of Barbs, Contexts, and Labels ⋮ Bisimulation congruence of \(\chi\)-calculus ⋮ Theory of interaction ⋮ A model of actors and grey failures ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Unnamed Item ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ Deriving structural labelled transitions for mobile ambients ⋮ Towards a Unified Approach to Encodability and Separation Results for Process Calculi ⋮ Free-algebra models for the \(\pi \)-calculus ⋮ On the decidability of fragments of the asynchronous π-calculus ⋮ Encoding Distributed Areas and Local Communication into the π-Calculus ⋮ Making the Unobservable, Unobservable ⋮ A WSDL-based type system for asynchronous WS-BPEL processes ⋮ Full abstraction for expressiveness: history, myths and facts ⋮ Relating reasoning methodologies in linear logic and process algebra ⋮ On the expressive power of \textsc{Klaim}-based calculi ⋮ A randomized encoding of the \(\pi\)-calculus with mixed choice ⋮ A hierarchy of equivalences for asynchronous calculi ⋮ Mobile objects as mobile processes ⋮ Unnamed Item ⋮ Event based choreography ⋮ Bisimulations in the join-calculus ⋮ Distributed processes and location failures ⋮ Distributed processes and location failures ⋮ Comparing communication primitives via their relative expressive power ⋮ Multiple-Labelled Transition Systems for nominal calculi and their logics ⋮ Full Abstraction for Linda ⋮ A formal approach to the engineering of domain-specific distributed systems ⋮ Unnamed Item ⋮ On the expressiveness of internal mobility in name-passing calculi ⋮ Typed behavioural equivalences for processes in the presence of subtyping ⋮ Comparing three semantics for Linda-like languages ⋮ On modelling mobility ⋮ Linda-based applicative and imperative process algebras ⋮ Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus ⋮ FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS ⋮ On the expressiveness of Linda coordination primitives. ⋮ Tile formats for located and mobile systems. ⋮ What is a ``good encoding of guarded choice? ⋮ Decoding choice encodings ⋮ Trace and testing equivalence on asynchronous processes
Uses Software
Cites Work
- Unnamed Item
- Some congruence properties for \(\pi\)-calculus bisimilarities
- The chemical abstract machine
- A calculus of mobile processes. II
- On reduction-based process semantics
- On the semantics of the call-by-name CPS transform
- Asynchronous process calculi: The first- and higher-order paradigms
- Decoding choice encodings
- A theory of bisimulation for the \(\pi\)-calculus
- Functions as processes
- Barbed bisimulation
This page was built for publication: On bisimulations for the asynchronous \(\pi\)-calculus
