New Bisimulation Semantics for Distributed Systems

DOI10.1007/978-3-540-73196-2_10zbMath1215.68161OpenAlexW2106221267MaRDI QIDQ3614847

Fernando Rosa-Velardo, Carlos Gregorio Rodríguez, David de Frutos-Escrig

Publication date: 10 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73196-2_10

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

(Bi)simulations up-to characterise process semantics, Simulations Up-to and Canonical Preorders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri nets and bisimulation
• Bisimulation and action refinement
• Simulations in coalgebra
• Higher-level synchronising devices in Meije-SCCS
• Concurrency and atomicity
• A calculus of communicating systems
• Maximality preserving bisimulation
• Universal coalgebra: A theory of systems
• An efficient algorithm for computing bisimulation equivalence
• Bisimulation from open maps
• Bisimulation on speed: a unified approach
• Concurrent bisimulations in Petri nets
• Introduction to Coalgebra
• A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras
• Non-strongly Stable Orders Also Define Interesting Simulation Relations
• Distributed bisimulations
• Replicated Ubiquitous Nets
• Bisimulation can't be traced
• Bisimulation and Co-induction: Some Problems
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• CONCUR 2005 – Concurrency Theory