Bisimulations in the join-calculus
From MaRDI portal
Publication:5958770
DOI10.1016/S0304-3975(00)00283-8zbMath0989.68098OpenAlexW2161347291MaRDI QIDQ5958770
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00283-8
calculusbisimulationlocalityconcurrencyasynchronous processesbarbed congruencechemical semanticsjoin-calculusname matching
Related Items (5)
On distributability ⋮ More on bisimulations for higher order \(\pi\)-calculus ⋮ An algebraic theory for web service contracts ⋮ A hierarchy of equivalences for asynchronous calculi ⋮ Trace and testing equivalence on asynchronous processes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The gamma model and its discipline of programming
- Some congruence properties for \(\pi\)-calculus bisimilarities
- A fully abstract semantics for causality in the \(\pi\)-calculus
- A calculus of mobile processes. II
- On the expressiveness of internal mobility in name-passing calculi
- On bisimulations for the asynchronous \(\pi\)-calculus
- On reduction-based process semantics
- Automata, languages and programming. 25th international colloquium, ICALP '98. Aalborg, Denmark, July 13--17, 1998. Proceedings
- Secure implementation of channel abstractions
- The name discipline of uniform receptiveness
- Automata, languages and programming. 24th international colloquium, ICALP '97, Bologna, Italy, July 7--11, 1997. Proceedings
- Proof Techniques for Cryptographic Processes
- Authentication primitives and their compilation
- Barbed bisimulation
- Distributed processes and location failures
- Implicit typing à la ML for the join-calculus
- A calculus of mobile agents
This page was built for publication: Bisimulations in the join-calculus
