Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-21437-0_32
Title: On combining state space reductions with global fairness assumptions
Authors: Zhang, S.J.
Sun, J.
Pang, J.
Liu, Y. 
Dong, J.S. 
Issue Date: 2011
Source: Zhang, S.J.,Sun, J.,Pang, J.,Liu, Y.,Dong, J.S. (2011). On combining state space reductions with global fairness assumptions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6664 LNCS : 432-447. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-21437-0_32
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. © 2011 Springer-Verlag.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/43181
ISBN: 9783642214363
ISSN: 03029743
DOI: 10.1007/978-3-642-21437-0_32
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 11, 2017

Page view(s)

54
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.