2000 character limit reached
Logics for Contravariant Simulations (2402.00964v1)
Published 1 Feb 2024 in cs.LO
Abstract: Covariant-contravariant simulation and conformance simulation are two generalizations of the simple notion of simulation which aim at capturing the fact that it is not always the case that "the larger the number of behaviors, the better". Therefore, they can be considered to be more adequate to express the fact that a system is a correct implementation of some specification. We have previously shown that these two more elaborated notions fit well within the categorical framework developed to study the notion of simulation in a generic way. Now we show that their behaviors have also simple and natural logical characterizations, though more elaborated than those for the plain simulation semantics.
- 20 Years of Mixed and Modal Specifications. Bulletin of the European Association for Theor. Comput. Sci., May 2008.
- On determinism in modal transition systems. Theor. Comput. Sci., 410(41):4026–4043, 2009.
- C. Cîrstea. A modular approach to defining and characterising notions of simulation. Inf. Comput., 204(4):469–502, 2006.
- L. de Alfaro and T. A. Henzinger. Interface automata. In ESEC / SIGSOFT FSE, pages 109–120, 2001.
- On the unification of semantics for processes: observational semantics. In SOFSEM 09, Proceedings, LNCS 5404, pages 279–290. Springer, 2009.
- New bisimulation semantics for distributed systems. In FORTE 2007, Proceedings, LNCS 4547, pages 143–159. Springer, 2007.
- Non-strongly stable orders also define interesting simulation relations. In CALCO 09, Proceedings, LNCS 5728, pages 221–235. Springer, 2009.
- M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. ACM, 32(1):137–161, 1985.
- J. Hughes and B. Jacobs. Simulations in coalgebra. Theor. Comput. Sci., 327(1-2):71–108, 2004.
- G. Leduc. A framework based on implementation relations for implementing LOTOS specifications. Computer Networks and ISDN Systems, 25(1):23–41, 1992.
- N. Lynch. I/O automata: A model for discrete event systems. In 22nd Annual Conference on Information Sciences and Systems pages 29–38, 1988.
- D. Park. Concurrency and automata on infinite sequences. In Theor. Comput. Sci. 5th GI-Conference, Proceedings, LNCS 104, pages 167–183. Springer, 1981.
- R. J. van Glabbeek. The linear time-branching time spectrum I: The semantics of concrete, sequential processes. In Handbook of process algebra, pages 3–99. North-Holland, 2001.