International audienceWe propose a semi-decision procedure for checking generalized reachability properties, on generalized Petri nets, that is based on the Property Directed Reachability (PDR) method. We actually define three different versions, that vary depending on the method used for abstracting possible witnesses, and that are able to handle problems of increasing difficulty. We have implemented our methods in a model-checker called SMPT and give empirical evidences that our approach can handle problems that are difficult or impossible to check with current state of the art tools
International audienceWe investigate the decidability and complexity status of model-checking proble...
International audienceWe investigate the decidability and complexity status of model-checking proble...
rEVIEWS IN MR 82b: 03079, ZBL 453 #03013; MR 81h: 68034, ZBL 453 #03012.Previously published in Pr...
International audienceWe propose a semi-decision procedure for checking generalized reachability pro...
AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...
International audienceWe define a new method for taking advantage of net reductions in combination w...
International audienceWe define a new method for taking advantage of net reductions in combination w...
AbstractPetri nets are fundamental to the analysis of distributed systems especially infinite-state ...
Property Directed Reachability (PDR), also known as IC3, is a very promising recent method for decid...
44 pagesAlthough decidable, the marking reachability problem for Petri nets is well-known to be intr...
44 pagesAlthough decidable, the marking reachability problem for Petri nets is well-known to be intr...
AbstractA new structure to analyse Petri nets and decide reachability is presented. Originated in Ma...
. In this paper we propose an efficient reachability set based Petri net analysis by introducing dy...
Petri nets, also known as vector addition systems, are a long established model of concurrency with ...
International audienceWe investigate the decidability and complexity status of model-checking proble...
International audienceWe investigate the decidability and complexity status of model-checking proble...
International audienceWe investigate the decidability and complexity status of model-checking proble...
rEVIEWS IN MR 82b: 03079, ZBL 453 #03013; MR 81h: 68034, ZBL 453 #03012.Previously published in Pr...
International audienceWe propose a semi-decision procedure for checking generalized reachability pro...
AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...
International audienceWe define a new method for taking advantage of net reductions in combination w...
International audienceWe define a new method for taking advantage of net reductions in combination w...
AbstractPetri nets are fundamental to the analysis of distributed systems especially infinite-state ...
Property Directed Reachability (PDR), also known as IC3, is a very promising recent method for decid...
44 pagesAlthough decidable, the marking reachability problem for Petri nets is well-known to be intr...
44 pagesAlthough decidable, the marking reachability problem for Petri nets is well-known to be intr...
AbstractA new structure to analyse Petri nets and decide reachability is presented. Originated in Ma...
. In this paper we propose an efficient reachability set based Petri net analysis by introducing dy...
Petri nets, also known as vector addition systems, are a long established model of concurrency with ...
International audienceWe investigate the decidability and complexity status of model-checking proble...
International audienceWe investigate the decidability and complexity status of model-checking proble...
International audienceWe investigate the decidability and complexity status of model-checking proble...
rEVIEWS IN MR 82b: 03079, ZBL 453 #03013; MR 81h: 68034, ZBL 453 #03012.Previously published in Pr...