New Bisimulation Semantics for Distributed Systems
From MaRDI portal
Publication:3614847
Recommendations
Cites work
- A calculus of communicating systems
- A syntactical approach to weak (bi-)simulation for coalgebras
- An efficient algorithm for computing bisimulation equivalence
- Bisimulation and action refinement
- Bisimulation and co-induction: some problems
- Bisimulation can't be traced
- Bisimulation from open maps
- Bisimulation on speed: a unified approach
- CONCUR 2005 – Concurrency Theory
- Concurrency and atomicity
- Concurrent bisimulations in Petri nets
- Distributed bisimulations
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Higher-level synchronising devices in Meije-SCCS
- scientific article; zbMATH DE number 176758 (Why is no real title available?)
- Introduction to coalgebra. Towards mathematics of states and observation
- Maximality preserving bisimulation
- Non-strongly stable orders also define interesting simulation relations
- Petri nets and bisimulation
- Replicated Ubiquitous Nets
- Simulations in coalgebra
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Universal coalgebra: A theory of systems
- Weak bisimulation for action-type coalgebras (extended abstract)
Cited in
(3)
This page was built for publication: New Bisimulation Semantics for Distributed Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614847)