Sciweavers

3 search results - page 1 / 1
» Expand, Enlarge, and Check: New Algorithms for the Coverabil...
Sort
View
JCSS
2006
51views more  JCSS 2006»
13 years 4 months ago
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Gilles Geeraerts, Jean-François Raskin, Lau...
FSTTCS
2004
Springer
13 years 10 months ago
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
Gilles Geeraerts, Jean-François Raskin, Lau...
CAV
2005
Springer
104views Hardware» more  CAV 2005»
13 years 10 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...