Skip to main content
SpringerLink
Log in

Automated generation of a progress measure for the sweep-line method

  • Special section on Tools and Algorithms for the Construction and Analysis of Systems
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

In the context of Petri nets, we propose an automated construction of a progress measure which is an important pre-requisite for a state space reduction technique called the sweep-line method. Our construction is based on linear-algebraic techniques concerning the transition vectors of the Petri net under consideration. We further discuss the possible combination of the sweep-line method with other state space reduction techniques (partial order reduction, the symmetry method).

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

Similar content being viewed by others

References

  1. Mailund, T.: Sweeping the state space. Ph.D. thesis, University of Aarhus (2003)

  2. Christensen, S., Kristensen, L.M., Mailund, T.: A sweep-line method for state space exploration. In: Proceedings of TACAS 2001, LNCS, vol. 2031, pp. 450–464 (2001)

  3. Kristensen, L.M., Mailund, T.: A generalized sweep-line method for safety properties. In: Proceedings of the FME 2002, LNCS vol. 2391, pp. 549–567 (2002)

  4. Godefroid, P., Wolper, P.: A partial approach to model checking. In: Proceedings of the 6th IEEE Symp. on Logic in Computer Science. pp. 406–415 Amsterdam (1991)

  5. Peled, D.: All from one, one for all: On model-checking using representitives. In: Proceedings of the 5th Interantional Conference on Computer Aided Verification, LNCS, vol. 697, pp. 409–423. Elounda, Greece (1993)

  6. Valmari, A.: Error detection by reduced reachability graph generation. In: Proceedings of the 9th European Workshop on Application and Theory of Petri Nets (1988)

  7. Schmidt, K.: Stubborn sets for standard properties. In: Proceedings of the 20th International Conference on Application and Theory of Petri nets, LNCS, vol. 1639, pp. 46–65 (1999)

  8. Valmari, A.: Stubborn sets for reduced state space generation. In: Advances of Petri Nets 1990, LNCS, vol. 483, pp. 491–511 (1991)

  9. Valmari, A.: On-the-fly verification with stubborn sets. In: 5th International Conference on Computer Aided Verification, LNCS, vol. 697, pp. 397–408 (1993)

  10. Kristensen, L.M., Valmari, A.: Improved question-guided stubborn set methods for state properties. In: Proceedings of the 21th International Conference on Application and Theory of Petri nets, LNCS, vol. 1835, pp. 282–302 (2000)

  11. Valmari, A.: Stubborn set methods for process algebras. In: Workshop on Partial Order Methods in Verification. pp. 192–210. Princeton (1996)

  12. Valmari, A.: The state explosion problem. In: Lectures on Petri nets I: Basic Models, LNCS, vol. 1491, pp. 429–528 (1998)

  13. Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM J. Comput. 1, 146–160 (1972)

    Article  MathSciNet  Google Scholar 

  14. Huber, P., Jensen, A., Jepsen, L.O., Jensen, K.: Towards reachability trees for high-level Petri nets. In: Advances in Petri Nets 1984, LNCS, vol. 188, pp. 215–233 (1984)

  15. Clarke, E.M., Enders, R., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. Formal Methods Syst. Design 9, 77–104 (1996)

    Article  Google Scholar 

  16. Emerson, E.A., Sistla, A.P.: Symmetry and model checking. Formal Methods Syst. Design. 9, 105–131 (1996)

    Article  Google Scholar 

  17. Ip, C.N., Dill, D.L.: Better verification through symmetry. Formal Methods Syst. Design 9, 41–75 (1996)

    Article  Google Scholar 

  18. Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: A symbolic reachability graph for Coloured Petri nets. Theor. Computer Sci. B 176(1/2), 39–65 (1997)

    Article  MathSciNet  Google Scholar 

  19. Schmidt, K.: How to calculate symmetries of Petri nets. Acta Inform. 36, 545–590 (2000)

    Article  MathSciNet  Google Scholar 

  20. Schmidt, K.: Integrating low level symmetries into reachability analysis. In: Proceedings of the TACAS 2000, LNCS, vol. 1785, pp. 315–331 (2000)

  21. Schmidt, K.: LoLA: A low level analyser. In: Proceedings of the 20th Intrenational Conference on Application and Theory of Petri net, LNCS, vol. 1825, pp. 465–474 (1999)

  22. Krstić, M., Grass, E.: GALSification of IEEE 802.11a Baseband Processor. In: Proceedings of PATMOS, LNCS, vol. 3254, pp. 258–267 (2004)

  23. Curbera, F., Goland, Y., Klein, J., Leymann, F., Roller, D., Thatte, S., Weerawarana, S.: Business process execution language for web services, Version 1.1. Technical Report, BEA Systems, IBM Corporation, Microsoft Corporation (2003)

  24. Stahl, C.: Transformation von BPEL4WS in Petrinetze. Diploma thesis, Humboldt-Universität zu Berlin (2004)

Download references

Author information

Authors and Affiliations

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

    Karsten Schmidt

Authors
  1. Karsten Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Karsten Schmidt.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schmidt, K. Automated generation of a progress measure for the sweep-line method. Int J Softw Tools Technol Transfer 8, 195–203 (2006). https://doi.org/10.1007/s10009-005-0201-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-005-0201-1

Keywords

Search

Navigation