Chapter

FM 2009: Formal Methods

Volume 5850 of the series Lecture Notes in Computer Science pp 123-139

Fair Model Checking with Process Counter Abstraction

  • Jun SunAffiliated withSchool of Computing, National University of Singapore
  • , Yang LiuAffiliated withSchool of Computing, National University of Singapore
  • , Abhik RoychoudhuryAffiliated withSchool of Computing, National University of Singapore
  • , Shanshan LiuAffiliated withSchool of Computing, National University of Singapore
  • , Jin Song DongAffiliated withSchool of Computing, National University of Singapore

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Parameterized systems are characterized by the presence of a large (or even unbounded) number of behaviorally similar processes, and they often appear in distributed/concurrent systems. A common state space abstraction for checking parameterized systems involves not keeping track of process identifiers by grouping behaviorally similar processes. Such an abstraction, while useful, conflicts with the notion of fairness. Because process identifiers are lost in the abstraction, it is difficult to ensure fairness (in terms of progress in executions) among the processes. In this work, we study the problem of fair model checking with process counter abstraction. Even without maintaining the process identifiers, our on-the-fly checking algorithm enforces fairness by keeping track of the local states from where actions are enabled / executed within an execution trace. We enhance our home-grown PAT model checker with the technique and show its usability via the automated verification of several real-life protocols.