More on bisimulations for higher order \(\pi\)-calculus
From MaRDI portal
Publication:442289
DOI10.1016/J.TCS.2012.04.014zbMath1277.68170OpenAlexW2053976095MaRDI QIDQ442289
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.014
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the expressiveness and decidability of higher-order process calculi
- Bisimulation for higher-order process calculi
- A calculus of mobile processes. II
- A hierarchy of equivalences for asynchronous calculi
- A CPS encoding of name-passing in higher-order mobile embedded resources
- A theory of weak bisimulation for Core CML
- Contextual equivalence for higher-order pi-calculus revisited
- Programming Languages and Systems
- Global Computing
- Foundations of Software Science and Computation Structures
- Bisimulations in the join-calculus
This page was built for publication: More on bisimulations for higher order \(\pi\)-calculus