Weak bisimilarity coalgebraically

DOI10.1007/978-3-642-03741-2_12MaRDI QIDQ2888485zbMATH OpenOpenAlexFDO

Authors Andrei Popescu

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

Mathematics Subject Classification ID

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)

Recommendations

• Weak bisimulation for action-type coalgebras (extended abstract)
• Weak bisimulations for coalgebras over ordered functors
• A syntactical approach to weak (bi-)simulation for coalgebras
• Coalgebraic Weak Bisimulation from Recursive Equations over Monads
• Towards weak bisimulation for coalgebras

Cites work

• A calculus of mobile processes. I
• A domain equation for bisimulation
• A fully abstract denotational semantics for the \(\pi\)-calculus
• A fully abstract model for the \(\pi\)-calculus.
• Automata, Languages and Programming
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1927579 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Models for name-passing processes: Interleaving and causal
• Observing behaviour categorically
• Processes as terms: non-well-founded models for bisimulation
• Structural operational semantics for weak bisimulations
• The -calculus: A theory of mobile processes
• Theoretical Aspects of Computing – ICTAC 2005
• Universal coalgebra: A theory of systems
• Weak bisimulation for action-type coalgebras (extended abstract)

Cited in

(1)

• Coalgebraic Weak Bisimulation from Recursive Equations over Monads

This page was built for publication: Weak bisimilarity coalgebraically

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2888485)