Skip to main content

DSSZ-MC – A Tool for Symbolic Analysis of Extended Petri Nets

  • Conference paper
Book cover Applications and Theory of Petri Nets (PETRI NETS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5606))

Included in the following conference series:

Abstract

DSSZ-MC supports the symbolic analysis of bounded place/ transition Petri nets extended by read, inhibitor, equal, and reset arcs. No previous knowledge of the precise boundedness degree is required. It contains tools for the efficient analysis of standard properties (boundedness, liveness, reversibility) and CTL model checking, built on an object-oriented implementation of Zero-suppressed Binary Decision Diagrams and Interval Decision Diagrams. The main features are saturation-based state space generation, analysis of strongly connected components, dead state analysis with trace generation, and CTL model checking by limited backward reachability analysis. The tool is available for Windows, Linux, and Mac/OS.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bause, F., Kemper, P., Kritzinger, P.: Abstract Petri Net Notation. Technical report, Univ. Dortmund, CS Dep. (1994)

    Google Scholar 

  2. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers C-35(8), 677–691 (1986)

    Article  MATH  Google Scholar 

  3. Clarke, E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press, Cambridge (1999) (third printing, 2001)

    Google Scholar 

  4. 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 

  5. Franzke, A.: A concept for redesigning Charlie. Technical report, BTU Cottbus, Dep. of CS (2008)

    Google Scholar 

  6. Gilbert, D., Heiner, M.: From Petri nets to differential equations - an integrative approach for biochemical network analysis. In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol. 4024, pp. 181–200. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Heiner, M., Gilbert, D., Donaldson, R.: Petri nets in systems and synthetic biology. In: Bernardo, M., Degano, P., Zavattaro, G. (eds.) SFM 2008. LNCS, vol. 5016, pp. 215–264. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Heiner, M., Richter, R., Schwarick, M.: Snoopy - a tool to design and animate/simulate graph-based formalisms. In: Proc. PNTAP 2008, associated to SIMUTools 2008. ACM digital library, New York (2008)

    Google Scholar 

  9. Koch, I., Junker, B.H., Heiner, M.: Application of Petri Net Theory for Modeling and Validation of the Sucrose Breakdown Pathway in the Potato Tuber. Bioinformatics 21(7), 1219–1226 (2005)

    Article  Google Scholar 

  10. 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 

  11. Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proc. 30th ACM/IEEE Design Automation Conference (DAC), pp. 272–277. ACM Press, New York (1993)

    Chapter  Google Scholar 

  12. Noack, A.: A ZBDD package for efficient model checking of Petri nets. Technical report, BTU Cottbus, Dep. of CS (1999) (in German)

    Google Scholar 

  13. Priese, L., Wimmel, H.: Theoretical Informatics - Petri Nets. Springer, Heidelberg (2003) (in German)

    MATH  Google Scholar 

  14. Ridder, H.: Analysis of Petri Net Models with Decision Diagrams. PhD thesis, University Koblenz-Landau (1997) (in German)

    Google Scholar 

  15. Schwarick, M.: Transient Analysis of Stochastic Petri Nets With Interval Decision Diagrams. In: Proc. 15th German Workshop on Algorithms and Tools for Petri Nets (AWPN 2008), September 2008. CEUR Workshop Proceedings, vol. 380, pp. 43–48. CEUR-WS.org (2008)

    Google Scholar 

  16. Schröter, C., Schwoon, S., Esparza, J.: The Model Checking Kit. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 463–472. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Strehl, K., Thiele, L.: Symbolic model checking using interval diagram techniques. Technical report, Computer Engineering and Networks Lab (TIK), Swiss Federal Institute of Technology (ETH) Zurich (1998)

    Google Scholar 

  18. Tovchigrechko, A.: Model Checking Using Interval Decision Diagrams. PhD thesis, BTU Cottbus, Dep. of CS (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heiner, M., Schwarick, M., Tovchigrechko, A. (2009). DSSZ-MC – A Tool for Symbolic Analysis of Extended Petri Nets. In: Franceschinis, G., Wolf, K. (eds) Applications and Theory of Petri Nets. PETRI NETS 2009. Lecture Notes in Computer Science, vol 5606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02424-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02424-5_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02423-8

  • Online ISBN: 978-3-642-02424-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics