Checking progress with aAction priority: is it fair?
File(s)
Technical report
Author(s)
Giannakopoulou, Dimitra
Magee, Jeffrey
Kramer, Jeff
Type
Report
Abstract
The liveness characteristics of a system are intimately related to the notion of fairness. However, the task of explicitly modelling fairness constraints is complicated in practice. To address this issue, we propose to check LTS (Labelled Transition System) models under a strong fairness assumption, which can be relaxed with the use of action priority. The combination of the two provides a novel and practical way of dealing with fairness. The approach is presented in the context of a class of liveness properties termed progress, for which it yields a particularly efficient model-checking algorithm. Progress properties cover a wide range of interesting properties of systems, while presenting a clear intuitive meaning to users.
Date Issued
1998-01-01
Citation
Departmental Technical Report: 98/2, 1998, pp.1-17
Publisher
Department of Computing, Imperial College London
Start Page
1
End Page
17
Journal / Book Title
Departmental Technical Report: 98/2
Copyright Statement
© 1998 The Author(s). This report is available open access under a CC-BY-NC-ND (https://creativecommons.org/licenses/by-nc-nd/4.0/)
License URL
ttps://creativecommons.org/licenses/by-nc-nd/4.0/
Publication Status
Published