Modular Games for Coalgebraic Fixed Point Logics


Cirstea, Corina and Sadrzadeh, Mehrnoosh, (2008) Modular Games for Coalgebraic Fixed Point Logics Adámek, Jiri and Kupke, Clemens (eds.) At Coalgebraic Methods in Computer Science 2008. , pp. 71-92.

Download

[img] PDF cmcs.pdf - Version of Record
Download (323kB)

Description/Abstract

We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation games. These results are generalisations of their correspondents in the modal mu-calculus, as described e.g. in [19]. Inspired by recent work of Venema [21], we provide our logics with evaluation games that come equipped with a modular way of building the game boards. We also study a specific class of modular coalgebraic logics that allow for the introduction of an implicit negation operator.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: Coalgebraic Methods in Computer Science 2008, 2008-01-01
Keywords: coalgebra, modal logic, fixed point logic, parity games
Organisations: Electronic & Software Systems
ePrint ID: 266888
Date :
Date Event
2008Published
Date Deposited: 07 Nov 2008 22:38
Last Modified: 17 Apr 2017 18:57
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/266888

Actions (login required)

View Item View Item