Model checking with fairness assumptions using PAT

No Thumbnail Available
File version
Author(s)
Si, Y
Sun, J
Liu, Y
Dong, JS
Pang, J
Zhang, SJ
Yang, X
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2014
Size
File type(s)
Location
License
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.

Journal Title

Frontiers of Computer Science

Conference Title
Book Title
Edition
Volume

8

Issue

1

Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Distributed computing and systems software not elsewhere classified

Information and computing sciences

Persistent link to this record
Citation
Collections