Model checking with strong fairness

Yonit Kesten, Amir Pnueli, Li On Raviv, Elad Shahar

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


In this paper we present a coherent framework for symbolic model checking of linear-time temporal logic (ltl) properties over finite state reactive systems, taking full fairness constraints into consideration. We use the computational model of a fair discrete system (fds) which takes into account both justice (weak fairness) and compassion (strong fairness). The approach presented here reduces the model-checking problem into the question of whether a given fds is feasible (i.e. has at least one computation). The contribution of the paper is twofold: On the methodological level, it presents a direct self-contained exposition of full ltl symbolic model checking without resorting to reductions to either μ-calculus or ctl. On the technical level, it extends previous methods by dealing with compassion at the algorithmic level instead of either adding it to the specification, or transforming compassion to justice. Finally, we extend CTL* with past operators, and show that the basic symbolic feasibility algorithm presented here, can be used to model check an arbitrary CTL* formula over an FDS with full fairness constraints.

Original languageEnglish
Pages (from-to)57-84
Number of pages28
JournalFormal Methods in System Design
Issue number1
StatePublished - 1 Jan 2006


  • CTL
  • Fair discrete systems
  • Fairness
  • LTL
  • Model checking
  • Temporal logic
  • Temporal testers


Dive into the research topics of 'Model checking with strong fairness'. Together they form a unique fingerprint.

Cite this