Weak Bisimilarity Coalgebraically
From MaRDI portal
Publication:2888485
DOI10.1007/978-3-642-03741-2_12zbMath1239.68053OpenAlexW1853270983MaRDI QIDQ2888485
Publication date: 1 June 2012
Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)
Full work available at URL: https://eprints.mdx.ac.uk/15381/1/CALCO2009.pdf
Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models for name-passing processes: Interleaving and causal
- Structural operational semantics for weak bisimulations
- A calculus of mobile processes. I
- A fully abstract model for the \(\pi\)-calculus.
- Universal coalgebra: A theory of systems
- A fully abstract denotational semantics for the \(\pi\)-calculus
- A domain equation for bisimulation
- Observing behaviour categorically
- Processes as terms: non-well-founded models for bisimulation
- Theoretical Aspects of Computing – ICTAC 2005
- Mathematical Foundations of Computer Science 2003
- Automata, Languages and Programming
This page was built for publication: Weak Bisimilarity Coalgebraically