From branching to linear time, coalgebraically
- Submitting institution
-
University of Southampton
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 20750094
- Type
- D - Journal article
- DOI
-
10.3233/FI-2017-1474
- Title of journal
- Fundamenta Informaticae
- Article number
- -
- First page
- 379
- Volume
- 150
- Issue
- 3-4
- ISSN
- 1875-8681
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2017
- 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
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper proposed a unifying view of linear time semantics for systems with quantitative behaviour. Taking a coalgebraic approach to modelling systems allowed not only to recover familiar notions (e.g. for probabilistic systems) but also to extend to new types of quantities (e.g. modelling resource usage). This was a key step towards generic and compositional quantitative verification techniques grounded in coalgebra. Such an approach was outlined in an invited talk at the Second Symposium on Compositional Structures (http://events.cs.bham.ac.uk/syco/2/), and is currently being developed as part of a 3 year project funded by the Leverhulme Trust (RPG-2020-232), with Cirstea as PI.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -