Checking Progress with Action Priority: Is it Fair?

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 modelchecking algorithm. Progress properties cover a wide range of interesting properties of systems, while presenting a clear intuitive meaning to users.

• Type: Conference
• Year: 1999
• Where: ESEC
• Authors: Dimitra Giannakopoulou, Jeff Magee, Jeff Kramer
• Keywords: ESEC 1999, Fairness Constraints, Labelled Transition System, Software Engineering, Strong Fairness Assumption