Duality for Logics of Transition Systems

We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category χ. The propositional logic used to reason about state spaces from χ is modelled by the Stone dual ${\mathcal A}$ of χ (e.g. if χ is Stone spaces then ${\mathcal A}$ is Boolean algebras and the propositional logic is the classical one). In order to obtain a modal logic for transition systems (i.e. for T-coalgebras) we consider the functor L on ${\mathcal A}$ that is dual to T. An adequate modal logic for T-coalgebras is then obtained from the category of L-algebras which is, by construction, dual to the category of T-coalgebras. The logical meaning of the duality is that the logic is sound and complete and expressive (or fully abstract) in the sense that non-bisimilar states are distinguished by some formula. We apply the framework to Vietoris coalgebras on topological spaces, using the duality between spaces and observation frames, to obtain adequate logics for transition systems on posets, sets, spectral spaces and Stone spaces.

[1]  Samson Abramsky,et al.  A Domain Equation for Bisimulation , 1991, Inf. Comput..

[2]  R. Goldblatt Metamathematics of modal logic , 1974, Bulletin of the Australian Mathematical Society.

[3]  Yde Venema,et al.  Stone coalgebras , 2004, Theor. Comput. Sci..

[4]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[5]  Bart Jacobs,et al.  Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study , 2001, RAIRO Theor. Informatics Appl..

[6]  Ramon Jansana,et al.  Priestley Duality, a Sahlqvist Theorem and a Goldblatt-Thomason Theorem for Positive Modal Logic , 1999, Log. J. IGPL.

[7]  Marcello M. Bonsangue,et al.  Toward an Infinitary Logic of Domains: Abramsky Logic for Transition Systems , 1999, Inf. Comput..

[8]  Lawrence S. Moss,et al.  Coalgebraic Logic , 1999, Ann. Pure Appl. Log..

[9]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[10]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[11]  M. Kracht Tools and Techniques in Modal Logic , 1999 .

[12]  E. Michael Topologies on spaces of subsets , 1951 .

[13]  James Worrell,et al.  Terminal sequences for accessible endofunctors , 1999, CMCS.

[14]  Alessandra Palmigiano,et al.  Coalgebraic Semantics for Positive Modal Logic , 2003, CMCS.

[15]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[16]  Josep Maria Font,et al.  A Survey of Abstract Algebraic Logic , 2003, Stud Logica.

[17]  Steven J. Vickers Information Systems for Continuous Posets , 1993, Theor. Comput. Sci..

[18]  Alessandra Palmigiano,et al.  A coalgebraic view on positive modal logic , 2004, Theor. Comput. Sci..

[19]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[20]  Jan van Eijck,et al.  Modal Logic, Transition Systems and Processes , 1993, J. Log. Comput..

[21]  Bart Jacobs,et al.  Duality Beyond Sober Spaces: Topological Spaces and Observation Frames , 1995, Theor. Comput. Sci..

[22]  Marcelo P Fiore,et al.  Topology via Logic , 1999 .

[23]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[24]  J. Gerbrandy Bisimulations on Planet Kripke , 1999 .

[25]  M. Bonsangue,et al.  Topological Dualities in Semantics , 1996 .