A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation

Authors:
Toby Wilkinson
Affiliations:
University of Southampton, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2012

Citing 8
Cited 0

Modal logic

Modal logic
Simulations in coalgebra

Theoretical Computer Science - Selected papers of CMCS'03
Stone coalgebras

Theoretical Computer Science - Selected papers of CMCS'03
Coalgebraic Modal Logic Beyond Sets

Electronic Notes in Theoretical Computer Science (ENTCS)
A modular approach to defining and characterising notions of simulation

Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Exemplaric Expressivity of Modal Logics

Journal of Logic 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
Ultrafilter extensions for coalgebras

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a previous paper we introduced internal models for coalgebraic modal logics and showed how they characterise expressivity for bismulation. Here we extend this work by enriching over preordered sets, and in so doing derive a characterisation that subsumes expressivity for both bisimulation and simulation.