2026-06-08T14:03:26Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/532152024-07-10T15:48:53Zcom_20.500.14352_14col_20.500.14352_21

Non-strongly stable orders also define interesting simulation relations Fábregas Alfaro, Ignacio Frutos Escrig, David De Palomino Tarjuelo, Miguel Kurz, Alexander Lenisa, Marina Tarlecki, Andrzej 004 Models and methods for concurrent and distributed computing Process algebras Bisimulation Transition nets Abstract data types Algebraic specification Informática (Informática) 1203.17 Informática 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. Sección Deptal. de Sistemas Informáticos y Computación Fac. de Ciencias Matemáticas Instituto de Matemática Interdisciplinar (IMI) TRUE pub 2023-06-20T13:39:07Z 2023-06-20T13:39:07Z 2009 book part https://hdl.handle.net/20.500.14352/53215 XXXX-XXXX 10.1007/978-3-642-03741-2_16 eng Lecture notes in computer science Fábregas Alfaro, I., Frutos Escrig, D. & Palomino Tarjuelo, M. «Non-strongly Stable Orders Also Define Interesting Simulation Relations». Algebra and Coalgebra in Computer Science, editado por Alexander Kurz et al., vol. 5728, Springer Berlin Heidelberg, 2009, pp. 221-35. DOI.org (Crossref), https://doi.org/10.1007/978-3-642-03741-2_16. open access application/pdf Springer