The University of Southampton
University of Southampton Institutional Repository

Model checking linear coalgebraic temporal logics: an automata-theoretic approach

Model checking linear coalgebraic temporal logics: an automata-theoretic approach
Model checking linear coalgebraic temporal logics: an automata-theoretic approach
We extend the theory of maximal traces of pointed non-deterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras. We then consider linear coalgebraic temporal logics interpreted over non-deterministic coalgebras, and show how to reduce the model checking problem for such logics to the problem of deciding the winner in a regular two-player game. Our approach is inspired by the automata-theoretic approach to model checking Linear Temporal Logic over transition systems.
coalgebra, trace, temporal logic, automata, model checking
130-144
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Corradini, Andrea
6cc7a106-fbf7-459c-90ae-bc855c67c664
Klin, Bartek
6cb55648-cfbc-43e9-917a-385a15dc5473
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Corradini, Andrea
6cc7a106-fbf7-459c-90ae-bc855c67c664
Klin, Bartek
6cb55648-cfbc-43e9-917a-385a15dc5473

Cirstea, Corina, (2011) Model checking linear coalgebraic temporal logics: an automata-theoretic approach Corradini, Andrea and Klin, Bartek (eds.) At 2011 International Conference on Algebra and Coalgebra in Computer Science. , pp. 130-144.

Record type: Conference or Workshop Item (Paper)

Abstract

We extend the theory of maximal traces of pointed non-deterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras. We then consider linear coalgebraic temporal logics interpreted over non-deterministic coalgebras, and show how to reduce the model checking problem for such logics to the problem of deciding the winner in a regular two-player game. Our approach is inspired by the automata-theoretic approach to model checking Linear Temporal Logic over transition systems.

PDF CALCO.pdf - Accepted Manuscript
Download (363kB)

More information

Published date: 2011
Venue - Dates: 2011 International Conference on Algebra and Coalgebra in Computer Science, 2011-01-01
Keywords: coalgebra, trace, temporal logic, automata, model checking
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 272356
URI: http://eprints.soton.ac.uk/id/eprint/272356
PURE UUID: 32a74c9d-b799-4d40-ad80-b2ee19ec82bd

Catalogue record

Date deposited: 28 May 2011 22:36
Last modified: 10 Nov 2017 22:25

Export record

Contributors

Author: Corina Cirstea
Editor: Andrea Corradini
Editor: Bartek Klin

University divisions

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.

×