Model Checking Linear Coalgebraic Temporal Logics: an Automata-Theoretic Approach
Cirstea, Corina (2011) Model Checking Linear Coalgebraic Temporal Logics: an Automata-Theoretic Approach. In, 2011 International Conference on Algebra and Coalgebra in Computer Science Springer.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
- Accepted Version
Download (355Kb) |
Description/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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Keywords: | coalgebra, trace, temporal logic, automata, model checking |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems |
| Item ID: | 272356 |
| Date Deposited: | 28 May 2011 22:36 |
| Last Modified: | 02 Mar 2012 12:42 |
| Contributors: | Cirstea, Corina (Author) Corradini, Andrea (Editor) Klin, Bartek (Editor) |
| Date: | 2011 |
| Status: | Published |
| Publisher: | Springer |
| Contact Email Address: | cc2@ecs.soton.ac.uk |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/272356 |
Actions (login required)
 |
View Item |
