From pnml to counter systems for accelerating Petri Nets with Fast

@inproceedings{BardinFromPT,
  title={From pnml to counter systems for accelerating Petri Nets with Fast},
  author={S{\'e}bastien Bardin and Laure Petrucci}
}
We use the tool Fast to check parameterized safety properties on Petri nets with a large or infinite state space. Although this tool is not dedicated to Petri nets, it can be used for these as place/transition nets (and some of their extensions) are subcases of Fast input model. The originality of the tool lies in the use of acceleration techniques in order to compute the exact reachability set for infinite systems. In this paper, we present the automatic transformation of Petri nets written in… CONTINUE READING

Similar Papers

Loading similar papers…