A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Proving safety properties of infinite state systems by compilation into Presburger arithmetic
[chapter]
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.
doi:10.1007/3-540-63141-0_15
fatcat:hmj6wmqgvffphksiciw6u5zedy