The University of Southampton
University of Southampton Institutional Repository

On Logics for Coalgebraic Simulation

On Logics for Coalgebraic Simulation
On Logics for Coalgebraic Simulation
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.
coalgebra, simulation, modal logic
63-90
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Adámek, J.
081dfea6-bdf4-4e79-860f-0ddca43f92ef
Milius, S.
6c2897ec-fef1-4ead-959d-afccd6722bed
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Adámek, J.
081dfea6-bdf4-4e79-860f-0ddca43f92ef
Milius, S.
6c2897ec-fef1-4ead-959d-afccd6722bed

Cirstea, Corina (2004) On Logics for Coalgebraic Simulation. Adámek, J. and Milius, S. (eds.) 7th International Workshop on Coalgebraic Methods in Computer Science, Barcelona, Spain. 27 - 29 Mar 2004. pp. 63-90 .

Record type: Conference or Workshop Item (Paper)

Abstract

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.

Text
cmcs.pdf - Other
Download (316kB)

More information

Published date: 2004
Additional Information: Event Dates: March 27 - 29, 2004
Venue - Dates: 7th International Workshop on Coalgebraic Methods in Computer Science, Barcelona, Spain, 2004-03-27 - 2004-03-29
Keywords: coalgebra, simulation, modal logic
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 260185
URI: http://eprints.soton.ac.uk/id/eprint/260185
PURE UUID: 209721d4-d213-4cf6-8b35-c498f47c9e67
ORCID for Corina Cirstea: ORCID iD orcid.org/0000-0003-3165-5678

Catalogue record

Date deposited: 13 Dec 2004
Last modified: 15 Mar 2024 03:18

Export record

Contributors

Author: Corina Cirstea ORCID iD
Editor: J. Adámek
Editor: S. Milius

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×