Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
Jacobs, B.P.F., Niqui, M., Rutten, J.J.M.M. and Silva, A. (eds.)
At Coalgebraic Methods in Computer Science 2010.
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 . 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  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.
Conference or Workshop Item
|Venue - Dates:
||Coalgebraic Methods in Computer Science 2010, 2010-01-01
||coalgebra, trace semantics, temporal logic, nondeterminism, probability
||Electronic & Software Systems
||07 May 2010 10:09
||17 Apr 2017 18:24
|Further Information:||Google Scholar|
Actions (login required)