Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS

@article{Geeraerts2006ExpandEA,
  title={Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS},
  author={Gilles Geeraerts and Jean-François Raskin and Laurent Van Begin},
  journal={J. Comput. Syst. Sci.},
  year={2006},
  volume={72},
  pages={180-203}
}
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… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
6 Extracted Citations
27 Extracted References
Similar Papers

Similar Papers

Loading similar papers…