Fair Model Checking with Process Counter Abstraction

  • Jun Sun
  • Yang Liu
  • Abhik Roychoudhury
  • Shanshan Liu
  • Jin Song Dong
Conference paper

DOI: 10.1007/978-3-642-05089-3_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5850)
Cite this paper as:
Sun J., Liu Y., Roychoudhury A., Liu S., Dong J.S. (2009) Fair Model Checking with Process Counter Abstraction. In: Cavalcanti A., Dams D.R. (eds) FM 2009: Formal Methods. FM 2009. Lecture Notes in Computer Science, vol 5850. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jun Sun
    • 1
  • Yang Liu
    • 1
  • Abhik Roychoudhury
    • 1
  • Shanshan Liu
    • 1
  • Jin Song Dong
    • 1
  1. 1.School of ComputingNational University of Singapore 

Personalised recommendations