Adventures in monitorability: From branching time to linear time and back again.
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 15201
- Type
- D - Journal article
- DOI
-
10.1145/3290365
- Title of journal
- Proceedings of the ACM on Programming Languages
- Article number
- 52
- First page
- 1
- Volume
- 3
- Issue
- POPL
- ISSN
- 2475-1421
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2019
- 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
-
4
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper introduced the idea that monitorability should be studied as a hierarchy rather than as a dichotomy. Lehtinen and her co-authors developed this further in "An operational guide to monitorability" (Conference on Software Engineering and Formal Methods'20), not REF returned. It also underpins some of the latest work in runtime verification, for example, by Aceto et al (Runtime Verification'19), Francalanza et al (Reversible Computation'20), and Sánchez et al (Formal Methods in System Design'19). Lehtinen was invited to give a series of lectures on this work at the BehAPI Summer School 2019 in Leicester (https://www.um.edu.mt/projects/behapi/summer-school-in-leicester/).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -