Non-strongly Stable Orders Also Define Interesting Simulation Relations (2402.00963v1)
Abstract: 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.
- P. Aczel and N. P. Mendler. A final coalgebra theorem. In D. H. Pitt, D. E. Rydeheard, P. Dybjer, A. M. Pitts, and A. Poigné, editors, Category Theory and Computer Science, vol 389 of LNCS, pages 357–365. Springer, 1989.
- Bisimulation can’t be traced. J. ACM, 42(1):232–268, 1995.
- D. de Frutos-Escrig and C. Gregorio-Rodríguez. Universal coinductive characterisations of process semantics. In G. Ausiello, J. Karhumäki, G. Mauri, and C.-H. L. Ong, editors, IFIP TCS, vol 273 of IFIP, pages 397–412. Springer, 2008.
- On the unification of semantics for processes: observational semantics. In M. Nielsen, A. Kucera, P. Bro Miltersen, C. Palamidessi, P. Tuma, and F. Valencia, editors, SOFSEM 09: Theory and Practice of Computer Science. 35th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings, vol 5404 of LNCS, pages 279–290. Springer, 2009.
- Structured operational semantics and bisimulation as a congruence. Inf. Comput., 100(2):202–260, 1992.
- J. Hughes and B. Jacobs. Simulations in coalgebra. TCS, 327(1-2):71–108, 2004.
- B. Jacobs and J. Hughes. Simulations in coalgebra. In H. P. Gumm, editor, CMCS’03: 6th International Workshop on Coalgebraic Methods in Computer Science, volume 82, 2003.
- K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Inf. Comput., 94(1):1–28, 1991.
- G. Leduc. A framework based on implementation relations for implementing LOTOS specifications. Computer Networks and ISDN Systems, 25(1):23–41, 1992.
- Hierarchical correctness proofs for distributed algorithms. In Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 137–151, 1987.
- D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science, 5th GI-Conference, Proceedings, vol 104 of LNCS, pages 167–183. Springer, 1981.
- J. Tretmans. Conformance testing with labelled transition systems: Implementation relations and test generation. Computer Networks and ISDN Systems, 29(1):49–79, 1996.
- R. J. van Glabbeek. The linear time-branching time spectrum I: The semantics of concrete, sequential processes. In J. A. Bergstra, A. Ponse, and S. A. Smolka, editors, Handbook of process algebra, pages 3–99. 2001.