Please use this identifier to cite or link to this item:
|Title:||PAT: Towards flexible verification under fairness||Authors:||Sun, J.
|Issue Date:||2009||Citation:||Sun, J.,Liu, Y.,Dong, J.S.,Pang, J. (2009). PAT: Towards flexible verification under fairness. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5643 LNCS : 709-714. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-02658-4_59||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. Current practice of system analysis is, however, deficient under fairness. In this work, we present PAT, a toolkit for flexible and efficient system analysis under fairness. A unified algorithm is proposed to model check systems with a variety of fairness effectively in two different settings. Empirical evaluation shows that PAT complements existing model checkers in terms of fairness. We report that previously unknown bugs have been revealed using PAT against systems functioning under strong global fairness. © 2009 Springer Berlin Heidelberg.||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/40037||ISBN:||3642026575||ISSN:||03029743||DOI:||10.1007/978-3-642-02658-4_59|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 12, 2019
checked on Oct 28, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.