A coalgebraic approach to linear-time logics
- Submitting institution
-
University of Southampton
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 20750096
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-642-54830-7_28
- Title of conference / published proceedings
- Foundations of Software Science and Computation Structures : FoSSaCS 2014
- First page
- 426
- Volume
- -
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper provided a step-change in the study of temporal fixpoint logics, by moving from branching-time to linear-time logics, and from two-valued to quantitative logics. This paved the way to a general, coalgebraic approach to quantitative verification, currently being developed by the same author (see https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8046 and http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2019.4), supporting a systematic shift from building correct-by-construction systems to building optimal-by-construction ones. This line of work was the subject of an invited talk at the recent “Coalgebra, Now” event (https://www.coalg.org/coalgebra-now-floc18/). A key application for this work is the verification and synthesis of resource-aware systems, with embedded and autonomous systems as prime examples.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -