On combining state space reductions with global fairness assumptions

Loading...
Thumbnail Image
File version

Accepted Manuscript (AM)

Author(s)
Zhang, SJ
Sun, J
Pang, J
Liu, Y
Dong, JS
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2011
Size
File type(s)
Location
License
Abstract

Model checking has established itself as an effective system analysis method, as it is capable of proving/dis-proving properties automatically. Its application to practical systems is however limited by state space explosion. Among effective state reduction techniques are symmetry reduction and partial order reduction. Global fairness often plays a vital role in designing self-stabilizing population protocols. It is known that combining fairness and symmetry reduction is nontrivial. In this work, we first show that global fairness, unlike weak/strong fairness, can be combined with symmetry reduction. We extend the PAT model checker with the technique and demonstrate its usability by verifying recently proposed population protocols. Second, we show that partial order reduction is not property-preserving with global fairness.

Journal Title

Lecture Notes in Computer Science

Conference Title
Book Title
Edition
Volume

6664 LNCS

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2011 Springer International Publishing AG. This is an electronic version of an article published in Lecture Notes In Computer Science (LNCS), 6664 LNCS pp. 442-447, 2011. Lecture Notes In Computer Science (LNCS) is available online at: http://link.springer.com// with the open URL of your article.

Item Access Status
Note
Access the data
Related item(s)
Subject

Software engineering not elsewhere classified

Persistent link to this record
Citation
Collections