Model checking with fairness assumptions using PAT

  • Authors:

  • Yuanjie Si;Jun Sun;Yang Liu;Jin Song Dong;Jun Pang;Shao Jie Zhang;Xiaohu Yang

  • Affiliations:

  • College of Computer Science, Zhejiang University, Hangzhou, China 310027;Information System Technology and Design, Singapore University of Technology and Design, Singapore, Singapore 138682;School of Computer Engineering, Nanyang Technological University, Singapore, Singapore 639798;School of Computing, National University of Singapore, Singapore, Singapore 117417;Faculty of Science, Technology and Communication, University of Luxembourg, Luxembourg, Luxembourg L-1359;Information System Technology and Design, Singapore University of Technology and Design, Singapore, Singapore 138682;College of Computer Science, Zhejiang University, Hangzhou, China 310027

  • Venue:
  • Frontiers of Computer Science: Selected Publications from Chinese Universities
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent development on distributed systems has shown that a variety of fairness constraints (some of which are only recently defined) play vital roles in designing self-stabilizing population protocols. Existing model checkers are deficient in verifying the systems as only limited kinds of fairness are supported with limited verification efficiency. In this work, we support model checking of distributed systems in the toolkit PAT (process analysis toolkit), with a variety of fairness constraints (e.g., process-level weak/strong fairness, event-level weak/strong fairness, strong global fairness). It performs on-the-fly verification against linear temporal properties. We show through empirical evaluation (on recent population protocols as well as benchmark systems) that PAT has advantage in model checking with fairness. Previously unknown bugs have been revealed against systems which are designed to function only with strong global fairness.