Skip to main content
SpringerLink
Log in

Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?

  • Conference paper
Applications and Theory of Petri Nets 2004 (ICATPN 2004)

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

Included in the following conference series:

Abstract

Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “explicit” algorithms that explore the reachability graph of a Petri net require memory and time at least proportional to the number of reachable markings, thus they are applicable only to fairly small systems in practice. Symbolic “implicit” algorithms, typically implemented using binary decision diagrams, have been successfully employed in much larger systems, but much of the work to date is based on breadth-first search techniques best suited for synchronous hardware verification. Here, instead, we describe recently-introduced data structures and algorithms particularly targeted to Petri nets and similar asynchronous models, and show why they are enormously more efficient for this application. We conclude with some directions for future research.

Work supported in part by the National Aeronautics and Space Administration under grant and NAG-1-02095 and by the National Science Foundation under grants CCR-0219745 and ACI-0203971.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agerwala, T.: A complete model for representing the coordination of asynchronous processes. Hopkins Computer Research Report 32, Johns Hopkins University, Baltimore, Maryland (July 1974)

    Google Scholar 

  2. Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. John Wiley & Sons, New York (1995)

    MATH  Google Scholar 

  3. Araki, T., Kasami, T.: Some decision problems related to the reachability problem for Petri nets. Theoretical Computer Science 3, 85–104 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bryant, R.E.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comp. Surv. 24(3), 293–318 (1992)

    Article  Google Scholar 

  5. Buchholz, P., Ciardo, G., Donatelli, S., Kemper, P.: Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp. 12(3), 203–222 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Buchholz, P., Kemper, P.: Numerical analysis of stochastic marked graphs. In: Proc. 6th Int. Workshop on Petri Nets and Performance Models (PNPM 1995), Durham, NC, October 1995, pp. 32–41. IEEE Comp. Soc. Press, Los Alamitos (1995)

    Chapter  Google Scholar 

  7. Ciardo, G.: Petri nets with marking-dependent arc multiplicity: properties and analysis. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol. 815, pp. 179–198. Springer, Heidelberg (1994)

    Google Scholar 

  8. Ciardo, G., Jones, R.L., Miner, A.S., Siminiceanu, R.: Logical and stochastic modeling with SMART. In: Kemper, P., Sanders, W.H. (eds.) TOOLS 2003. LNCS, vol. 2794, pp. 78–97. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Ciardo, G., Luettgen, G., Siminiceanu, R.: Efficient symbolic state-space construction for asynchronous systems. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 103–122. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Ciardo, G., Luettgen, G., Siminiceanu, R.: Saturation: An efficient iteration strategy for symbolic state space generation. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 328–342. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Ciardo, G., Marmorstein, R., Siminiceanu, R.: Saturation unbound. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 379–393. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Ciardo, G., Miner, A.S.: Storage alternatives for large structured state spaces. In: Marie, R., Plateau, B., Calzarossa, M.C., Rubino, G.J. (eds.) TOOLS 1997. LNCS, vol. 1245, pp. 44–57. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  13. Ciardo, G., Miner, A.S.: A data structure for the efficient Kronecker solution of GSPNs. In: Buchholz, P. (ed.) Proc. 8th Int. Workshop on Petri Nets and Performance Models (PNPM 1999), Zaragoza, Spain, September 1999, pp. 22–31. IEEE Comp. Soc. Press, Los Alamitos (1999)

    Chapter  Google Scholar 

  14. Ciardo, G., Siminiceanu, R.: Using edge-valued decision diagrams for symbolic generation of shortest paths. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 256–273. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Ciardo, G., Siminiceanu, R.: Structural symbolic CTL model checking of asynchronous systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 40–53. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Ciardo, G., Trivedi, K.S.: A decomposition approach for stochastic reward net models. Perf. Eval. 18(1), 37–59 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  17. Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NuSMV: A new symbolic model verifier. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 495–499. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  18. Colom, J.M., Silva, M.: Convex geometry and semiflows in P/T nets: A comparative study of algorithms for the computation of minimal p-semiflows. In: 10th Int. Conf. on Application and Theory of Petri Nets, Bonn, Germany, pp. 74–95 (1989)

    Google Scholar 

  19. Daly, D., Deavours, D.D., Doyle, J.M., Webster, P.G., Sanders, W.H.: Möbius: An Extensible Tool for Performance and Dependability Modeling. In: Haverkort, B.R., Bohnenkamp, H.C., Smith, C.U. (eds.) TOOLS 2000. LNCS, vol. 1786, pp. 332–336. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  20. Davio, M.: Kronecker products and shuffle algebra. IEEE Trans. Comp C-30, 116–125 (1981)

    Article  MathSciNet  Google Scholar 

  21. Donatelli, S.: Superposed generalized stochastic Petri nets: definition and efficient solution. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol. 815, pp. 258–277. Springer, Heidelberg (1994)

    Google Scholar 

  22. Graf, S., Steffen, B., Luttgen, G.: Compositional minimisation of finite state systems using interface specifications. Formal Asp. of Comp. 8(5), 607–616 (1996)

    Article  MATH  Google Scholar 

  23. Hack, M.: Decidability questions for Petri nets. Technical Report 161, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA (June 1976)

    Google Scholar 

  24. Burch, J.R., Clarke, E.M., Long, D.E.: Symbolic model checking with partitioned transition relations. In: Halaas, A., Denyer, P.B. (eds.) Int. Conference on Very Large Scale Integration, Edinburgh, Scotland, August 1991. IFIP Transactions, pp. 49–58. North-Holland, Amsterdam (1991)

    Google Scholar 

  25. Kam, T.: State Minimization of Finite State Machines using Implicit Techniques. PhD thesis, University of California at Berkeley (1995)

    Google Scholar 

  26. Kam, T., Villa, T., Brayton, R., Sangiovanni-Vincentelli, A.: Multi-valued decision diagrams: theory and applications. Multiple-Valued Logic 4(1-2), 9–62 (1998)

    MATH  MathSciNet  Google Scholar 

  27. Miner, A.S.: Efficient Solution of GSPNs using canonical matrix diagrams. In: Proc. 9th Int. Workshop on Petri Nets and Performance Models, Aachen, Germany, September 2001, pp. 101–110 (2001)

    Google Scholar 

  28. Miner, A.S., Ciardo, G.: Efficient reachability set generation and storage using decision diagrams. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 6–25. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  29. Murata, T.: Petri Nets: properties, analysis and applications. Proc. of the IEEE 77(4), 541–579 (1989)

    Article  Google Scholar 

  30. Pastor, E., Cortadella, J., Roig, O.: Symbolic analysis of bounded Petri nets. IEEE Trans. Comp. 50(5), 432–448 (2001)

    Article  MathSciNet  Google Scholar 

  31. Pastor, E., Roig, O., Cortadella, J., Badia, R.: Petri net analysis using boolean manipulation. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol. 815, pp. 416–435. Springer, Heidelberg (1994)

    Google Scholar 

  32. Petri, C.: Kommunikation mit Automaten. PhD thesis, University of Bonn, Bonn, West Germany (1962)

    Google Scholar 

  33. Plateau, B.: On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In: Proc. ACM SIGMETRICS, Austin, TX, USA, May 1985, pp. 147–153 (1985)

    Google Scholar 

  34. Roig, O., Cortadella, J., Pastor, E.: Verification of asynchronous circuits by BDD-based model checking of Petri nets. In: DeMichelis, G., Díaz, M. (eds.) ICATPN 1995. LNCS, vol. 935, pp. 374–391. Springer, Heidelberg (1995)

    Google Scholar 

  35. Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proc. IEEE Int. Conf. on Computer-Aided Design, November 1993, pp. 139–144 (1993)

    Google Scholar 

  36. Somenzi, F.: CUDD: CU Decision Diagram Package, Release 2.3.1., http://vlsi.colorado.edu/~fabio/CUDD/cuddIntro.html

  37. Tani, S., Hamaguchi, K., Yajima, S.: The complexity of the optimal variable ordering problems of shared binary decision diagrams. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762. Springer, Heidelberg (1993)

    Google Scholar 

  38. Valk, R.: On the computational power of extended Petri nets. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 527–535. Springer, Heidelberg (1978)

    Google Scholar 

  39. Valk, R.: Generalizations of Petri nets. In: Gruska, J., Chytil, M.P. (eds.) MFCS 1981. LNCS, vol. 118, pp. 140–155. Springer, Heidelberg (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of California, Riverside, Riverside, CA, 92521, USA

    Gianfranco Ciardo

Authors
  1. Gianfranco Ciardo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Spain

    Jordi Cortadella

  2. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Wolfgang Reisig

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciardo, G. (2004). Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?. In: Cortadella, J., Reisig, W. (eds) Applications and Theory of Petri Nets 2004. ICATPN 2004. Lecture Notes in Computer Science, vol 3099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27793-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27793-4_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22236-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation