Bisimulation through probabilistic testing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Fixpoint semantics and simulation
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Communication and Concurrency
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A compositional approach to defining logics for coalgebras
Theoretical Computer Science - Selected papers of CMCS'03
Probabilistic Logical Characterization
Information and Computation
Similarity quotients as final coalgebras
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Logics for contravariant simulations
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Preorders on monads and coalgebraic simulations
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
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.