Modular Games for Coalgebraic Fixed Point Logics
Cirstea, Corina and Sadrzadeh, Mehrnoosh (2008) Modular Games for Coalgebraic Fixed Point Logics. In, Coalgebraic Methods in Computer Science 2008 Elsevier, 71-92.
- Version of Record
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 . Inspired by recent work of Venema , 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)|
|Keywords:||coalgebra, modal logic, fixed point logic, parity games|
|Divisions:||Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
|Date Deposited:||07 Nov 2008 22:38|
|Last Modified:||31 Mar 2016 14:13|
Towards a Modular Approach to Model-Based Verification: logical, semantical and algorithmic support
Funded by: EPSRC (EP/D000033/1)
Led by: Corina Cirstea
19 January 2006 to 18 January 2008
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)