A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logics
The literature on process theory and structural operational semantics abounds with various notions of behavioural equivalence and, more generally, simulation preorders. An important problem in this area from the point of view of logic is to find formulas that characterize states in finite transition systems with respect to these various relations. Recent work by Aceto et al. shows how such characterizing formulas in equational modal fixed point logics can be obtained for a wide variety of behavioural preorders using a single method. In this paper, we apply this basic insight from the work by Aceto et al. to Baltag’s “logics for coalgebraic simulation” to obtain a general result that yields characteristic formulas for a wide range of relations, including strong bisimilarity, simulation, as well as bisimulation and simulation on Markov chains and more. Hence this paper both generalizes the work of Aceto et al. and makes explicit the coalgebraic aspects of their work.
KeywordsLabel Transition System Kripke Frame Structural Operational Semantic Characteristic Formula Weak Bisimulation
- 8.Kurz, A., Leal, R.: Equational coalgebraic logic. In: Abramsky, S., Mislove, M., Palamidessi, C. (eds.): Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009) Electronic Notes in Theoretical Computer Science, vol. 249, pp. 333–356 (2009)Google Scholar
- 10.Marti, J.: Relation liftings in coalgebraic modal logic. M.Sc. thesis, Institute for Logic, Language and Computation, University of Amsterdam (2011)Google Scholar
- 12.Marti, J., Venema, Y.: Lax extensions of coalgebra functors and their logics. J. Comput. Syst. Sci. (2014), to appearGoogle Scholar
- 17.Thijs, A.: Simulation and fixpoint semantics. Ph.D. thesis, University of Groningen (1996)Google Scholar