Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics


Cirstea, Corina (2010) Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics. In, Coalgebraic Methods in Computer Science 2010 Elsevier, 83-103.

Download

[img] PDF - Accepted Version
Download (326Kb)

Description/Abstract

This paper gives a general coalgebraic account of the notions of possibly infinite trace and possibly infinite execution in state-based, dynamical systems, by extending the generic theory of finite traces and executions developed by Hasuo and coauthors [8]. The systems we consider are modelled as coalgebras of endofunctors obtained as the composition of a computational type (e.g. nondeterministic or stochastic) with a general transition type. This generalises existing work by Jacobs [10] that only accounts for a nondeterministic computational type. We subsequently introduce path-based temporal (including fixpoint) logics for coalgebras of such endofunctors, whose semantics is based upon the notion of possibly infinite execution. Our approach instantiates to both nondeterministic and stochastic computations, yielding, in particular, path-based fixpoint logics in the style of CTL* for nondeterministic systems, as well as generalisations of the logic PCTL for probabilistic systems.

Item Type: Conference or Workshop Item (Paper)
Keywords: coalgebra, trace semantics, temporal logic, nondeterminism, probability
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
ePrint ID: 271026
Date Deposited: 07 May 2010 10:09
Last Modified: 27 Mar 2014 20:16
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/271026

Actions (login required)

View Item View Item

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