par Geeraerts, Gilles ;Raskin, Jean-François ;Van Begin, Laurent
Référence Journal of computer and system sciences, 72, 1, page (180-203)
Publication Publié, 2006-02
Article révisé par les pairs
Résumé : In this paper, we present a general algorithmic schema called 'Expand, Enlarge and Check' from which new algorithms for the coverability problem of WSTS can be constructed. We show here that our schema allows us to define forward algorithms that decide the coverability problem for several classes of systems for which the Karp and Miller procedure cannot be generalized, and for which no complete forward algorithms were known. Our results have important applications for the verification of parameterized systems and communication protocols. A preliminary version of this paper has been published as [Geeraerts et al., Expand, enlarge and check: new algorithms for the coverability problem of WSTS, in: Proceedings of the 24th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 04), Lecture Notes in Computer Science, vol. 3328, Springer, Berlin, 2004, pp. 287-298] in the proceedings of FST&TCS 2004. © 2005 Elsevier Inc. All rights reserved.