Skip to main content
SpringerLink
Log in

Computing reachability properties hidden in finite net unfoldings

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1997)

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

Abstract

It is commonly known that every reachable marking of a finite-state Petri net system is represented in its finite unfolding according to McMillan. Also the reachability of markings from each other is represented in the finite unfolding, but it is almost unknown that this information can be hidden very deep. This paper presents an efficient method for gaining this information, which is of course of great importance for potential modelcheckers working on finite unfoldings. All results presented in this paper also hold for a recently proposed optimized unfolding method.

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. Bernardinello, L., De Chindio, F.: A survey of basic net models and modular net classes. G. Rozenberg, ed., Advances in Petri nets 1992, Lecture Notes in Computer Science 609, (Springer, Berlin, 1992) 304–351.

    Google Scholar 

  2. Best, E., Devillers, R.: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science, 55(1), (1987) 299–323.

    Article  MathSciNet  Google Scholar 

  3. Best, E., Fernández, C: Nonsequential processes — a Petri net view. EATCS Monographs on Theoretical Computer Science 13 (1988).

    Google Scholar 

  4. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2), (1986) 244–263.

    Article  MATH  Google Scholar 

  5. Engelfriet, J.: Branching processes of Petri nets. Acta Informatica 28, (1991) 575–591.

    Article  MATH  MathSciNet  Google Scholar 

  6. Esparza, J.: Model checking using net unfoldings. Science of Computer Programming 23, (1994) 151–195.

    Article  MATH  MathSciNet  Google Scholar 

  7. Esparza, J., Römer, S., Vogler, W.: An Improvement of McMillan's Unfolding Algorithm. T. Margaria, B. Steffen, ed., Proceedings of TACAS'96, LNCS 1055, (1996) 87–106.

    Google Scholar 

  8. McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. Proceedings of the 4th Workshop on Computer Aided Verification, (Montreal, 1992) 164–174.

    Google Scholar 

  9. Petri, C.A.: Kommunikation mit Automaten. Schriften des Institutes für Instrumentelle Mathematik, (Bonn, 1962).

    Google Scholar 

  10. Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. Proceedings of the 5th International Symposium on Programming, LNCS 137, (1981) 337–351.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, UniversitÄt Hildesheim, Marienburger Platz 22, D-31141, Hildesheim, Germany

    Burkhard Graves

Authors
  1. Burkhard Graves
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Ramesh G Sivakumar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Graves, B. (1997). Computing reachability properties hidden in finite net unfoldings. In: Ramesh, S., Sivakumar, G. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1997. Lecture Notes in Computer Science, vol 1346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0058040

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69659-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation