Sciweavers

2 search results - page 1 / 1
» Monotonic Extensions of Petri Nets: Forward and Backward Sea...
Sort
View
ENTCS
2002
80views more  ENTCS 2002»
13 years 4 months ago
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited
In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data struct...
Alain Finkel, Jean-François Raskin, Mathias...
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...