Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1997: CONCUR '97: Concurrency Theory pp 213–227Cite as

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

  • Contributions
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1243))

Abstract

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 verification of safety properties of Petri nets with infinite 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. 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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Berthelot. “Transformations and Decompositions of Nets”. Advances in Petri Nets, LNCS 254, Springer-Verlag, 1986, pp. 359–376.

    Google Scholar 

  2. A. Boudet and H. Comon, “Diophantine Equations, Presburger Arithmetic and Finite Automata”, Proc. CAAP, LNCS 1059, Springer-Verlag, 1996, pp. 30–43.

    Google Scholar 

  3. G.W. Brams. Réseaux de Petri: Théorie et Pratique, Masson, Paris, 1983.

    Google Scholar 

  4. J.M. Couvreur and E. Paviot-Adet. “New Structural Invariants for Petri Nets Analysis”. Proc. Application and Theory of Petri Nets, LNCS 815, Springer-Verlag, 1994.

    Google Scholar 

  5. F. Chu and X. Xie. Deadlock Analysis of Petri Nets Using Siphons and Mathematical Programming. Submitted to IEEE Trans. on Robotics and Automation, 1996, 29 pages.

    Google Scholar 

  6. R. David and H. Alla. Du Grafcet aux Réseaux de Petri, Hermès, Paris, 1989.

    Google Scholar 

  7. A. Finkel and L. Petrucci. “Composition/Décomposition de Réseaux de Petri et de leurs Graphes de Couverture”. Informatique Théorique et Applications 28:2, 1994, pp. 73–124.

    Google Scholar 

  8. L. Fribourg and H. Olsén. A Decompositional Approach for Computing the Least Fixed-points of Datalog Programs with Z-counters. Technical Report LIENS-96-12, Ecole Normale Supérieure, Paris, July 1996. (Available on http://www.dmi.ens.fr/dmi/preprints)

    Google Scholar 

  9. S. Ginsburg. The Mathematical Theory of Context-Free Languages. McGraw-Hill, 1966.

    Google Scholar 

  10. N. Halbwachs. “Delay Analysis in Synchronous Programs”, Proc. Computer Aided Verification, LNCS 697, Springer-Verlag, 1993, pp. 333–346.

    Google Scholar 

  11. K. Hiraishi. “Reduced State Space Representation for Unbounded Vector State Spaces”, Proc. Application and Theory of Petri Nets, LNCS 1091, Springer-Verlag, 1996, pp. 230–248.

    Google Scholar 

  12. J. Jaffar and J.L. Lassez. “Constraint Logic Programming”, Proc. 14th ACM Symp. on Principles of Programming Languages, 1987, pp. 111–119.

    Google Scholar 

  13. P. Kanellakis, G. Kuper and P. Revesz. “Constraint Query Languages”. Internal Report, November 1990. (Short version in Proc. 9th ACM Symp. on Principles of Database Systems, Nashville, 1990, pp. 299–313).

    Google Scholar 

  14. R.M. Karp and R.E. Miller. “Parallel Program Schemata”. J. Computer and System Sciences: 3, 1969, pp. 147–195.

    Google Scholar 

  15. F. Laroussinie and K. Larsen. “Compositional Model Checking of Real Time Systems”. Proc. CONCUR, LNCS 962, Springer-Verlag, 1995, pp. 27–41.

    Google Scholar 

  16. M. Presburger. “Uber die Vollstandingen einer gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervotritt”, Comptes Rendus du premier Congrès des Mathématiciens des Pays Slaves, Varszawa, 1929.

    Google Scholar 

  17. A. Valmari. “Compositional State Space Generation”, Advances in Petri Nets, LNCS 674, Springer-Verlag, 1993, pp. 427–457.

    Google Scholar 

  18. H-C. Yen. “On the Regularity of Petri Net Languages”. Information and Computation 124, 1996, pp. 168–181.

    Google Scholar 

  19. M.C. Zhou, F. Dicesare and A.A. Desrochers. “A Hybrid Methodology for Synthesis of Petri Net Models for Manufacturing Systems”, IEEE Trans. on Robotics and Automation, vol. 8:3, 1992, pp. 350–361.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSV, E.N.S. Cachan & CNRS, 61 av. Wilson, 94235, Cachan, France

    Laurent Fribourg

  2. IDA, Linköping University, S-58183, Linköping, Sweden

    Hans Olsén

Authors
  1. Laurent Fribourg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Olsén
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz Józef Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fribourg, L., Olsén, H. (1997). Proving safety properties of infinite state systems by compilation into Presburger arithmetic. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-63141-0_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63141-5

  • Online ISBN: 978-3-540-69188-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation