Skip to main content
Springer Nature Link
Log in

BDDs vs. Zero-Suppressed BDDs: for CTL symbolic model checking of Petri nets

  • Conference paper
  • First Online:
Formal Methods in Computer-Aided Design (FMCAD 1996)

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

Included in the following conference series:

  • 189 Accesses

Abstract

This paper proposes using Zero-Suppressed BDDs for the CTL symbolic model checking of Petri nets. Since the state spaces of Petri nets are often very sparse, it is expected that ZBDDs represent such sparse state spaces more efficiently than BDDs. Further, we propose special BDD/ZBDD operations for Petri nets which accelerate the manipulations of Petri nets. The approaches to handling Petri nets based on BDDs and ZBDDs are compared with several example nets, and it is shown that ZBDDs are more suitable for the symbolic manipulation of Petri nets.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. R. Burch, E. M. Clarke, D. L. Dill, L. J. Hwang, and K. L. McMillan. Symbolic model checking: 1020 states and beyond. Academic Press, 98(2):142–170, 1992.

    Google Scholar 

  2. D. L. Dill. Trace theory for automatic hierarchical verification of speedindependent circuits. MIT press, 1988.

    Google Scholar 

  3. K. Hamaguchi, H. Hiraishi, and S. Yajima. Design verification of asynchronous sequential circuits using symbolic model checking. Proc. of International Symposium on Logic Synthesis and Microprocessor Architecture, pages 84–90, 1992.

    Google Scholar 

  4. K. Hamaguchi and S. Yajima. Symbolic model checking for Petri nets using block partitions. FTC workshop (in Japanese), 1993.

    Google Scholar 

  5. D. E. Long. BDD library man page. 1993.

    Google Scholar 

  6. K. L. McMillan. Trace theoretic verification of asynchronous circuits using unfoldings. LNCS 939 Computer aided verification, pages 180–195, 1995.

    Google Scholar 

  7. Shinichi Minato. Zero-suppressed BDDs for set manipulation in combinatorial problems. Proc. of 30th DAC, pages 272–277, 1993.

    Google Scholar 

  8. Oriol Roig, Jordi Cortadella, and Enric Pastor. Verification of asynchronous circuits by BDD-based model checking of Petri nets. LNCS 935 Application and theory of Petri nets 1995, pages 374–391, 1995.

    Google Scholar 

  9. Alexei Semenov and Alexandre Yakovlev. Combining partial orders and symbolic traversal for efficient verification of asynchronous circuits. Proc. of CHDL'95, pages 567–573, 1995.

    Google Scholar 

  10. T. Yoneda and T. Yoshikawa. Using partial orders for trace theoretic verification of asynchronous circuits. Proc. of Second International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 152–163, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tokyo Institute of Technology, Japan

    Tomohiro Yoneda & Hideyuki Hatori

  2. NTT LSI Laboratories, Japan

    Atsushi Takahara & Shin-ichi Minato

Authors
  1. Tomohiro Yoneda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hideyuki Hatori
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Atsushi Takahara
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shin-ichi Minato
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mandayam Srivas Albert Camilleri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoneda, T., Hatori, H., Takahara, A., Minato, Si. (1996). BDDs vs. Zero-Suppressed BDDs: for CTL symbolic model checking of Petri nets. In: Srivas, M., Camilleri, A. (eds) Formal Methods in Computer-Aided Design. FMCAD 1996. Lecture Notes in Computer Science, vol 1166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031826

Download citation

  • DOI: https://doi.org/10.1007/BFb0031826

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61937-6

  • Online ISBN: 978-3-540-49567-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics