Non-strongly stable orders also define interesting simulation relations



Downloads per month over past year

Fábregas Alfaro, Ignacio and Frutos Escrig, David de and Palomino, Miguel (2009) Non-strongly stable orders also define interesting simulation relations. In Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings. Lecture notes in computer science (5728). Springer, pp. 221-235. ISBN 978-3-642-03740-5

[thumbnail of Frutos07oficial.pdf]

Official URL:


We present a study of the notion of coalgebraic simulation introduced by Hughes and Jacobs. Although in their original paper they allow any functorial order in their definition of coalgebraic simulation, for the simulation relations to have good properties they focus their attention on functors with orders which are strongly stable. This guarantees a so-called “composition-preserving” property from which all the desired good properties follow. We have noticed that the notion of strong stability not only ensures such good properties but also “distinguishes the direction” of the simulation. For example, the classic notion of simulation for labeled transition systems, the relation “p is simulated by q”, can be defined as a coalgebraic simulation relation by means of a strongly stable order, whereas the opposite relation, “p simulates q”, cannot. Our study was motivated by some interesting classes of simulations that illustrate the application of these results: covariant-contravariant simulations and conformance simulations.

Item Type:Book Section
Uncontrolled Keywords:Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.); Abstract data types; algebraic specification
Subjects:Sciences > Computer science
ID Code:20652
Deposited On:05 Apr 2013 10:51
Last Modified:10 Aug 2018 08:35

Origin of downloads

Repository Staff Only: item control page