Non-strongly Stable Orders Also Define Interesting Simulation Relations
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.
KeywordsGood Property Label Transition System Process Algebra Stable Order Opposite Relation
Unable to display preview. Download preview PDF.
- 3.de Frutos-Escrig, D., Gregorio-Rodríguez, C.: Universal coinductive characterisations of process semantics. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, C.-H.L. (eds.) IFIP TCS. IFIP, vol. 273, pp. 397–412. Springer, Heidelberg (2008)Google Scholar
- 4.de Frutos Escrig, D., Gregorio-Rodríguez, C., Palomino, M.: On the unification of semantics for processes: observational semantics. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 279–290. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 7.Jacobs, B., Hughes, J.: Simulations in coalgebra. In: Gumm, H.P. (ed.) CMCS 2003: 6th International Workshop on Coalgebraic Methods in Computer Science, vol. 82 (2003)Google Scholar
- 10.Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 137–151 (1987)Google Scholar
- 13.van Glabbeek, R.J.: The linear time-branching time spectrum I: The semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of process algebra, pp. 3–99 (2001)Google Scholar