Skip to main content
SpringerLink
Log in

A negative result on depth-first net unfoldings

  • Formal Methods Letter
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Baldan, P., Corradini, A., König, B.: Verifying finite-state graph grammars: an unfolding-based approach. In: Proceedings of CONCUR ’04, LNCS 3170, pp. 83–98 (2004)

  2. Couvreur, J.-M., Grivet, S., Poitrenaud, D.: Unfolding of products of symmetrical Petri nets. In: Proceedings of ICATPN’01, LNCS 2075. Springer, Heidelberg (2001)

  3. Couvreur, J.-M., Grivet, S., Poitrenaud, D.: Designing an LTL model-checker based on unfolding graphs. In: Proceedings of ICATPN 2000, LNCS 1825. Springer, Heidelberg (2000)

  4. Esparza, J., Heljanko, K.: A new unfolding approach to LTL model checking. In: Proceedings of ICALP’00, LNCS 1853, pp. 475–486. Springer, Heidelberg, July (2000)

  5. Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: Proceedings of SPIN’01, LNCS 2057, pp. 37–56. Springer, Heidelberg, May (2001)

  6. Esparza, J., Römer, S.: An unfolding algorithm for synchronous products of transition systems. In: Proceedings of CONCUR’99, LNCS 1664, pp. 2–20. Springer, Heidelberg (1999)

  7. Esparza J., Römer S. and Vogler W. (2002). An improvement of McMillan’s unfolding algorithm. Form. Methods Syst. Des. 20: 285–310

    Article  MATH  Google Scholar 

  8. Khomenko V., Koutny M. and Vogler W. (2003). Canonical prefixes of Petri net unfoldings. Acta. Inform. 40(2): 95–118

    Article  MATH  MathSciNet  Google Scholar 

  9. Khomenko V., Koutny M. and Yakovlev A. (2004). Detecting state encoding conflicts in STG unfoldings using SAT. Fundamenta Informaticae 62(2): 221–241

    MATH  MathSciNet  Google Scholar 

  10. Khomenko, V., Koutny, M., Yakovlev, A.: Logic synthesis for asynchronous circuits based on Petri net unfoldings and incremental SAT. In: Proceedings of ACSD’04. IEEE (2004)

  11. McMillan, K.L.: Private communication

  12. McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Proceedings of CAV’92, LNCS 663. Springer, Heidelberg (1993)

  13. McMillan K.L. (1995). A technique of state space search based on unfolding. Form. Methods Syst. Des. 6(1): 45–65

    Article  MATH  MathSciNet  Google Scholar 

  14. McMillan, K.L.: Trace theoretic verification of asynchronous circuits using unfoldings. In: Proceedings of CAV’95, LNCS 939. Springer, Heidelberg (1995)

  15. Melzer, S., Römer, S.: Deadlock checking using net unfoldings. In: Proceedings of CAV’97, LNCS 1254 (1997)

  16. Vogler,W., Semenov, A.L., Yakovlev, A.: Unfolding and finite prefix for nets with read arcs. In: Proceedings of CONCUR ’98, LNCS 1466. Springer, Heidelberg (1998)

Download references

Author information

Authors and Affiliations

  1. Institute for Formal Methods in Computer Science, University of Stuttgart, Stuttgart, Germany

    Javier Esparza & Stefan Schwoon

  2. Department of Computer Science and Engineering, IIT Bombay, Mumbai, India

    Pradeep Kanade

Authors
  1. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pradeep Kanade
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Schwoon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Schwoon.

Additional information

Work done while Pradeep Kanade was visiting the University of Stuttgart, partially supported by the project “Algorithms for Software Model Checking” funded by the Deutsche Forschungsgemeinschaft.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Esparza, J., Kanade, P. & Schwoon, S. A negative result on depth-first net unfoldings. Int J Softw Tools Technol Transf 10, 161–166 (2008). https://doi.org/10.1007/s10009-007-0030-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-007-0030-5

Keywords

Search

Navigation