Non-strongly Stable Orders Also Define Interesting Simulation Relations

DOI10.1007/978-3-642-03741-2_16zbMath1239.68051OpenAlexW1599333409MaRDI QIDQ2888489

I. Fábregas, Miguel Palomino, David de Frutos-Escrig

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.ucm.es/20652/1/Frutos07oficial.pdf

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Characteristic formulae for fixed-point semantics: a general framework, New Bisimulation Semantics for Distributed Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Simulations in coalgebra
• Bisimulation through probabilistic testing
• Structured operational semantics and bisimulation as a congruence
• On the Unification of Process Semantics: Observational Semantics
• Bisimulation can't be traced
• A framework based on implementation relations for implementing LOTOS specifications