Advertisement

Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets

  • Rubén Carvajal-Schiaffino
  • Giorgio Delzanno
  • Giovanni Chiola
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2031)

Abstract

We propose a new validation algorithm for bounded Petri Nets. Our method combines state enumeration and structural techniques in order to compute under-approximations of the reachability set and graph of a net. The method is based on two heuristics that exploit properties of T-semiflows to detect acyclic behaviors. T-semiflows also give us an heuristic estimation of the number of levels of the reachability graph we have to keep in memory during forward exploration. This property allows us to organize the space used to store the reachable markings as a circular array, reusing all markings outside a sliding window containing a fixed number of the last levels of the graph. We apply the method to examples taken from the literature [ABC+95,CM97,MCC97]. Our algorithm returns exact results in all the experiments. In some examples, the circular memory allow us to save up to 98% of memory space, and to scale up to 255 the number of tokens in the specification of the initial marking.

Keywords

Safety Property Circular Array Structural Technique Reachability Graph Exhaustive Search Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. ABC+95.
    M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. Series in Parallel Computing. John Wiley & Sons, 1995.Google Scholar
  2. BCB+90.
    J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and J. Hwang. Symbolic Model Checking: 1020 States and Beyond. In Proc. LICS’ 90, pages 428–439, 1990.Google Scholar
  3. Chi89.
    G. Chiola. Compiling Techniques for the Analysis of Stochastic Petri Nets. In Modelling Techniques and Tools for Computer Performance Evaluation, pages 11–24, 1989.Google Scholar
  4. CFGR95.
    G. Chiola, G. Franceschinis, R. Gaeta, and M. Ribaudo. GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets. In Performance Evaluation, 24(1–2):47–68, 1995.zbMATHCrossRefGoogle Scholar
  5. CM97.
    G. Ciardo and A. S. Miner. Storage Alternatives for large structured state spaces. In Proc. Modelling Techniques and Tools for Computer Performance Ev8luation, LNCS 1245, pages 44–57. Springer, 1997.CrossRefGoogle Scholar
  6. CDC00.
    R. Carvajal-Schiaffino, G. Delzanno, and G. Chiola. Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets: A New ‘Type 2’ Validation Algorithm. Technical Report, DISI-00-10, Dipartimento di Informatica e Scienze dell’Informazione dell’Universitá di Genova, October 2000.Google Scholar
  7. DR00.
    G. Delzanno and J. F. Raskin. Symbolic Representation of Upward-closed Sets. In Proc. TACAS 2000, LNCS 1785, pages 426–440. Springer, 2000.Google Scholar
  8. Des98.
    J. Desel. Basic Linear Algebraic Techniques for Place/Transition Nets. In Reisig and Rozenberg [RR98], pages 257–308, 1998.Google Scholar
  9. DE95.
    J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.Google Scholar
  10. DR98.
    J. Desel and W. Reisig. Place/Transition Petri Nets. In Reisig and Rozenberg [RR98], pages 122–173, 1998.Google Scholar
  11. EM00.
    J. Esparza and S. Melzer. Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design, 16:159–189, 2000.CrossRefGoogle Scholar
  12. GGZ95.
    F. Gagnon, J.-Ch. Grégoire, and D. Zampuniéris. Sharing Trees for ‘Onthe-fly’ Verification. In Proc. FORTE’ 95, 1995.Google Scholar
  13. Gra97.
    B. Grahlmann. The PEP Tool. In Proc. CAV’97, LNCS 1254, pages 440–443. Springer, 1997.Google Scholar
  14. Hol88.
    G. Holzmann. Algorithms for Automated Protocol Verification. AT&T Technical Journal 69(2):32–44, 1988.Google Scholar
  15. JJ91.
    C. Jard and Th. Jéron. Bounded-memory Algorithms. In Proc. CAV’91, LNCS 575, pages 192–202. Springer, 1991.Google Scholar
  16. MCC97.
    P. Marenzoni, S. Caselli, and G. Conte. Analysis of Large GSPN Models: A Distributed Solution Tool. In Proc. Int. Work. on Petri Nets and Performance, 1997.Google Scholar
  17. McM93.
    K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic, 1993.Google Scholar
  18. MK96.
    H. Miller and S. Katz. Saving Space by Fully Exploiting Invisible Transitions. In Proc. CAV’ 96, LNCS 1102, pages 336–347. Springer, 1996.Google Scholar
  19. MC99.
    A. Miner and G. Ciardo. Efficient Reachability Set Generation and Storage using Decision Diagrams. In Proc. ICATPN’ 99, LNCS 1639, pages 6–25. Springer, 1999.Google Scholar
  20. PCP99.
    E. Pastor, J. Cortadella, and M. A. Peña. Structural Methods to Improve the Symbolic Analysis of Petri Nets. In Proc. ICATPN’ 99, LNCS 1639, pages 26–45. Springer, 1999.Google Scholar
  21. Rei86.
    W. Reisig. Petri Nets. An introduction. EATCS Monographs on Theoretical Computer Science, Springer 1986.Google Scholar
  22. RR98.
    W. Reisig and G. Rozenberg, editors. Lectures on Petri Nets I: Basic Models. Advances in Petri Nets, LNCS 1491. Springer, 1998.Google Scholar
  23. Sch94.
    A. Schrijver. Theory of Linear and Integer Programming, Wiley & Sons, 1994.Google Scholar
  24. STC98.
    M. Silva, E. Teruel, and J. M. Colom. Linear Algebraic and Linear Programming Techniques for Analysis of Place/Transition Net Systems. In Reisig and Rozenberg [RR98], pages 308–309, 1998.Google Scholar
  25. ST99.
    K. Strehl and L. Thiele. Interval Diagram Techniques For Symbolic Model Checking of Petri Nets. In Proc. DATE’99, pages 756–757, 1999.Google Scholar
  26. Val98.
    A. Valmari. The State Explosion Problem. In Reisig and Rozenberg [RR98], pages 308–309, 1998.Google Scholar
  27. Wim97.
    G. Wimmel. A BDD-based Model Checker for the PEP Tool. Technical Report, University of Newcastle upon Tyne, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Rubén Carvajal-Schiaffino
    • 1
  • Giorgio Delzanno
    • 1
  • Giovanni Chiola
    • 1
  1. 1.Dipartimento di Informatica e Scienze dell’InformazioneUniversità di GenovaGenova

Personalised recommendations