On quasi-open bisimulation
DOI10.1016/J.TCS.2004.10.041zbMATH Open1077.68060OpenAlexW2131851771MaRDI QIDQ557789FDOQ557789
Authors: Yuxi Fu 
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.041
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- A calculus of mobile processes. I
- The \(\pi\)-calculus: A theory of mobile processes
- A complete inference system for a class of regular behaviours
- A complete axiomatisation for observational congruence of finite-state behaviours
- Symbolic bisimulations
- A theory of bisimulation for the \(\pi\)-calculus
- Tau laws for pi calculus
- Algebraic theories for name-passing calculi
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- On the expressiveness of interaction
- INQUISITIVE BISIMULATION
- Parameterizing higher-order processes on names and processes
- Open bisimulation, revisited
- Title not available (Why is that?)
- Fair ambients
- Applying a testing approach to the calculus of fair ambients
- Open Maps Bisimulations for Higher Dimensional Automata Models
- Distinguishing and relating higher-order and first-order processes by expressiveness
- Theory of interaction
This page was built for publication: On quasi-open bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557789)
