Proving safety properties of infinite state systems by compilation into Presburger arithmetic [chapter]

Laurent Fribourg, Hans Olsén
1997 Lecture Notes in Computer Science  
We present in this paper a method combining path decomposition and bottom-up computation features for characterizing the reachability sets of Petri nets within Presburger arithmetic. An application of our method is the automatic veri cation of safety properties of Petri nets with in nite reachability sets. Our implementation is made of a decomposition module and an arithmetic module, the latter being built upon Boudet-Comon's algorithm for solving the decision problem for Presburger arithmetic.
more » ... Our approach will be illustrated on three nontrivial examples of Petri nets with unbounded places and parametric initial markings. ? Part of this work was done while the author was visiting IASI-CNR (Roma), supported by HCM-Network CHRX.CT.930414 and IASI-CNR.
doi:10.1007/3-540-63141-0_15 fatcat:hmj6wmqgvffphksiciw6u5zedy