On combining state space reductions with global fairness assumptions

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Zhang, S. J., Sun, J., Pang, J., Liu, Y., & Dong, J. S. (2011). On combining state space reductions with global fairness assumptions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6664 LNCS, pp. 432–447). https://doi.org/10.1007/978-3-642-21437-0_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free