Skip to main content
SpringerLink
Log in

Merged processes: a new condensed representation of Petri net behaviour

  • Original article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Model checking based on Petri net unfoldings is an approach widely applied to cope with the state space explosion problem. In this paper, we propose a new condensed representation of a Petri net’s behaviour called merged processes, which copes well not only with concurrency, but also with other sources of state space explosion, viz sequences of choices and non-safeness. Moreover, this representation is sufficiently similar to the traditional unfoldings, so that a large body of results developed for the latter can be re-used. Experimental results indicate that the proposed representation of a Petri net’s behaviour alleviates the state space explosion problem to a significant degree and is suitable for model checking.

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. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999)

  2. Corbett J.C. (1996). Evaluating Deadlock detection methods for concurrent software. IEEE Trans. Softw. Eng. 22:161–180

    Article  Google Scholar 

  3. Desel J., Esparza J. (1995). Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science 40, Cambridge University Press, Cambridge

    MATH  Google Scholar 

  4. Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Proceedings of SAT’03, LNCS 2919, 502–518 (2003)

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Esparza, J.: Decidability and Complexity of Petri Net Problems—an Introduction In: Lectures on Petri nets I: basic models, LNCS 1491, pp. 374–428 (1998)

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

    MATH  Google Scholar 

  8. Harel D., Lachover H., Naamad A., Pnueli A. et al. (1990). STATEMATE: a working environment for the development of complex reactive systems. IEEE Trans. Soft. Eng. 16:403–414

    Article  Google Scholar 

  9. Heljanko K. (1999). Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-Safe Petri Nets. Fundam. Inf. 37:247–268

    MATH  MathSciNet  Google Scholar 

  10. Kahn, G.: The Semantics of a Simple Language for Parallel Programming. In: Proceedings of IFIP Congress, North Holland, pp. 471–475 (1974)

  11. Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings PhD Thesis, School of Computing Science, University of Newcastle (2003)

  12. Khomenko, V., Kondratyev, A., Koutny, M., Vogler, V.: Merged processes – a New Condensed Representation of Petri Net Behaviour. In: Proceedings of CONCUR’05, LNCS 3653, pp. 338–352 (2005)

  13. Khomenko V., Koutny M., Vogler V. (2003). Canonical prefixes of Petri net unfoldings Acta Inf. 40:95–118

    Article  MATH  MathSciNet  Google Scholar 

  14. Khomenko V., Koutny M., Yakovlev A. (2004). Detecting state coding conflicts in STG unfoldings using SAT Fundam. Inf. 62:221–241

    MATH  MathSciNet  Google Scholar 

  15. McMillan, K.L.: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. In: Proceedings of CAV’92, LNCS 663, pp. 164–174 (1992)

  16. McMillan, K.L.: Symbolic Model Checking: an Approach to the State Explosion Problem PhD Thesis, CMU-CS-92-131 (1992)

  17. Melzer, S., Römer, S.: Deadlock Checking Using Net Unfoldings. In: Proceedings of CAV’97, LNCS 1254, pp. 352–363 (1997)

  18. Moskewicz, S., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: CHAFF: Engineering an Efficient SAT Solver. In: Proceedings of DAC’01, ASME Tech. Publ., pp. 530–535 (2001)

  19. Murata T. (1989). Petri Nets: properties, analysis and applications. Proc. of IEEE 77:541–580

    Article  Google Scholar 

  20. Valmari, A.: The State Explosion Problem. In: Lectures on Petri nets I: basic models, LNCS 1491, pp. 429–528 (1998)

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, University of Newcastle, Newcastle, NE1 7RU, UK

    Victor Khomenko & Maciej Koutny

  2. Cadence Berkeley Labs, Berkeley, CA, 94704, USA

    Alex Kondratyev

  3. Institut für Informatik, Universität Augsburg, Augsburg, 86135, Germany

    Walter Vogler

Authors
  1. Victor Khomenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alex Kondratyev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Victor Khomenko.

Additional information

V. Khomenko is a Royal Academy of Engineering/Epsrc Research Fellow supported by the RAEng/Epsrc grant EP/C53400X/1 (Davac).

M. Koutny is supported by the EC IST grant 511599 (Rodin).

W. Vogler is supported by the DFG-project STG-Dekomposition VO 615/7-1

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khomenko, V., Kondratyev, A., Koutny, M. et al. Merged processes: a new condensed representation of Petri net behaviour. Acta Informatica 43, 307–330 (2006). https://doi.org/10.1007/s00236-006-0023-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-006-0023-y

Keywords

Search

Navigation