A relation-algebraic theory of bisimulations
From MaRDI portal
Publication:3507553
zbMATH Open1151.68041MaRDI QIDQ3507553FDOQ3507553
Authors: Michael Winter
Publication date: 20 June 2008
Recommendations
Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cylindric and polyadic algebras; relation algebras (03G15)
Cited In (20)
- Embedding mappings and splittings with applications
- Title not available (Why is that?)
- Bisimulations and bisimulation quotients of generalized Veltman models
- Bisimulation and coverings for graphs and hypergraphs
- Title not available (Why is that?)
- Bisimilarity of Diagrams
- Bisimulation of automata
- Bisimulation as a logical relation
- Using relation-algebraic means and tool support for investigating and computing bipartitions
- A semiring approach to equivalences, bisimulations and control
- Compatibility of refining and controlling plant automata with bisimulation quotients
- Origins of bisimulation and coinduction
- Relating coalgebraic notions of bisimulation
- Bisimulations and unfolding in P-accessible categorical models
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Ordered Category of Processes
- Title not available (Why is that?)
- Bisimulation indexes and their applications
- Two observations in dioid based model refinement
This page was built for publication: A relation-algebraic theory of bisimulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507553)