A modular approach to defining and characterising notions of simulation

We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notions of simulation for such systems, and inductive techniques to define the syntax and semantics of modal logics for coalgebras. We show that the expressiveness of an inductively defined logic for coalgebras w.r.t. a notion of simulation follows from an expressivity condition involving one step in the definition of the logic, and the relator inducing that notion of simulation. Moreover, we show that notions of simulation and associated characterising logics for increasingly complex system types can be derived by lifting the operations used to combine system types, to a relational level as well as to a logical level. We use these results to obtain Baltag's logic for coalgebraic simulation, as well as notions of simulation and associated logics for a large class of non-deterministic and probabilistic systems.

[1]  Albert Thijs,et al.  Simulation and fixpoint semantics , 1996 .

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

[3]  Corina Cîrstea On Expressivity and Compositionality in Logics for Coalgebras , 2003, CMCS.

[4]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[5]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[6]  Corina Cîrstea,et al.  On Logics for Coalgebraic Simulation , 2004, CMCS.

[7]  Bart Jacobs,et al.  Structural Induction and Coinduction in a Fibrational Setting , 1998, Inf. Comput..

[8]  Corina Cîrstea,et al.  A compositional approach to defining logics for coalgebras , 2004, Theor. Comput. Sci..

[9]  Bart Jacobs,et al.  Simulations in Coalgebra , 2003, CMCS.

[10]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[11]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[12]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

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

[14]  Alexandru Baltag,et al.  A Logic for Coalgebraic Simulation , 2000, CMCS.

[15]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[16]  Bart Jacobs,et al.  Categorical Logic and Type Theory , 2001, Studies in logic and the foundations of mathematics.

[17]  Wim H. Hesselink,et al.  Fixpoint semantics and simulation , 2000, Theor. Comput. Sci..

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

[19]  R. V. Glabbeek The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR , 2007 .

[20]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[21]  Sally Popkorn,et al.  A Handbook of Categorical Algebra , 2009 .

[22]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[23]  Amir Pnueli The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[24]  Erik P. de Vink,et al.  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1997, Theor. Comput. Sci..

[25]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[26]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[27]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

[28]  Corina Cîrstea,et al.  Modular Construction of Modal Logics , 2004, CONCUR.

[29]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

[30]  Hans A. Hansson Time and probability in formal design of distributed systems , 1991, DoCS.

[31]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

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

[33]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[34]  Erik P. de Vink,et al.  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1999, Theor. Comput. Sci..