Bisimulation through probabilistic testing
Information and Computation
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Fixpoint semantics and simulation
Theoretical Computer Science
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
Using coalgebra and coinduction to define ontology-based multi-agent systems
International Journal of Metadata, Semantics and Ontologies
Probabilistic Logical Characterization
Information and Computation
Coalgebraic logic over general measurable spaces ??? a survey
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
We investigate logics for coalgebraic simulation from a compositional perspective. Specifically, we show that the expressiveness of an inductively-defined language for coalgebras w.r.t. a given notion of simulation comes as a consequence of an expressivity condition between the language constructor used to define the language for coalgebras, and the relator used to define the notion of simulation. This result can be instantiated to obtain Baltag's logics for coalgebraic simulation, as well as a logic which captures simulation on unlabelled probabilistic transition systems. Moreover, our approach is compositional w.r.t. coalgebraic types. This allows us to derive logics which capture other notions of simulation, including trace inclusion on labelled transition systems, and simulation on discrete Markov processes.