A coalgebraic approach to linear-time logics
A coalgebraic approach to linear-time logics
We extend recent work on defining linear-time behaviour for state-based systems with branching, and propose modal and fixpoint logics for specifying linear-time temporal properties of states in such systems. We model systems with branching as coalgebras whose type arises as the composition of a branching monad and a polynomial endofunctor on the category of sets, and employ a set of truth values induced canonically by the branching monad. This yields logics for reasoning about quantitative aspects of linear-time behaviour. Examples include reasoning about the probability of a linear-time behaviour being exhibited by a system with probabilistic branching, or about the minimal cost of a linear-time behaviour being exhibited by a system with weighted branching. In the case of non-deterministic branching, our logic supports reasoning about the possibility of exhibiting a given linear-time behaviour, and therefore resembles an existential version of the logic LTL
978-3-642-54830-7
426-440
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
2014
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Cirstea, Corina
(2014)
A coalgebraic approach to linear-time logics.
Muscholl, A
(ed.)
In Foundations of Software Science and Computation Structures: FoSSaCS 2014.
vol. 8412,
Springer.
.
(doi:10.1007/978-3-642-54830-7_28).
Record type:
Conference or Workshop Item
(Paper)
Abstract
We extend recent work on defining linear-time behaviour for state-based systems with branching, and propose modal and fixpoint logics for specifying linear-time temporal properties of states in such systems. We model systems with branching as coalgebras whose type arises as the composition of a branching monad and a polynomial endofunctor on the category of sets, and employ a set of truth values induced canonically by the branching monad. This yields logics for reasoning about quantitative aspects of linear-time behaviour. Examples include reasoning about the probability of a linear-time behaviour being exhibited by a system with probabilistic branching, or about the minimal cost of a linear-time behaviour being exhibited by a system with weighted branching. In the case of non-deterministic branching, our logic supports reasoning about the possibility of exhibiting a given linear-time behaviour, and therefore resembles an existential version of the logic LTL
Text
fossacs.pdf
- Accepted Manuscript
More information
e-pub ahead of print date: 21 March 2014
Published date: 2014
Venue - Dates:
17th International Conference on Foundations of Software Science and Computation Structures, Grenoble, France, 2014-04-05 - 2014-04-14
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 373410
URI: http://eprints.soton.ac.uk/id/eprint/373410
ISBN: 978-3-642-54830-7
ISSN: 0302-9743
PURE UUID: fc2d55a8-2e38-406a-a6a6-af6543d6ba64
Catalogue record
Date deposited: 16 Jan 2015 13:42
Last modified: 16 Mar 2024 03:36
Export record
Altmetrics
Contributors
Author:
Corina Cirstea
Editor:
A Muscholl
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