Skip to main content
SpringerLink
Log in

Deadlock prevention using Petri nets and their unfoldings

  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Unfoldings of Petri nets (PN) provide a method for the analysis of concurrent systems without restoring the state space of a system. This allows one to overcome the “state explosion” problem. Many properties of the initial PN (boundedness, safety, persistency and hazards) can be checked by constructing the unfolding. A deadlock prevention procedure first detects deadlocks using an unfolding. Then, the first method reduces the unfolding to a set of deadlock-free subunfoldings that cover all live behaviours. The second method uses a direct transformation at the level of the original PN. The methods are implemented as subroutines in the Berkeley program SIS. Although the deadlock detection problem is known to be NP-complete, experimental results show that for highly parallel specifications deadlock prevention by unfoldings is typically more efficient than deadlock prevention based on symbolic BDD (binary decision diagrams) traversal of the corresponding reachability graph.

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. Z. Banaszak and B. Krogh, “Deadlock avoidance in flexible manufacture systems with concurrently competing process flows”, IEEE Transactions on Robotics and Automation, 6(6), pp. 724–734, December 1990.

    Google Scholar 

  2. J. Ezpleta, J. Colom and J. Martinez, “A Petri net based deadlock prevention policy for flexible manufacture systems”, IEEE Transactions on Robotics and Automation, 11(2), pp. 173–184, April 1995.

    Google Scholar 

  3. K. L. McMillan, “A technique of state space search based on unfolding”, Formal Methods in System Design, 6(1), pp. 45–65, 1995.

    Google Scholar 

  4. J. Esparza, S. Römer and W. Vogler, “An improvement of McMillan's unfolding algorithm”, in Tools and Algorithms for the Construction and Analysis of Systems, vol. 1055 of Lecture Notes in Computer Science, pp. 87–106, Passau, Germany, Springer-Verlag, March 1996.

    Google Scholar 

  5. J. L. Peterson, Petri Nets, vol. 9, ACM Computing Surveys, 3, September 1977.

  6. A. Kondratyev, M. Kishinevsky, A. Taubin and S. Ten, “A structural approach for the analysis of Petri nets by reduced unfoldings”, in Applications and Theory of Petri Nets 1996, 17th International Conference, Proceedings, vol. 1091 of Lecture Notes in Computer Science, pp. 346–365, Osaka, Japan, June, 1996.

  7. L. Pomello, G. Rozenberg and C. Simone, “A survey of equivalence notions for net based systems”, Lecture Notes in Computer Science, 609, pp. 410–472, 1993

    Google Scholar 

  8. J. Cortadella, M. Kishinevsky, L. Lavagno and A. Yakovlev, “Syntheizing Petri nets from state-based models”, in Proceedings of the International Conference on Computer-Aided Design, pp. 164–171, November 1995.

  9. A. Taubin, A. Kondratyev and M. Kishinevsky, “Deadlock prevention using Petri nets and their unfoldings”, Technical Report 97-2-004, The University of Aizu, 1997.

  10. V. I. Varshavsky, M. A. Kishinevsky, V. B. Marakhovsky, V. A. Peschansky, L. Y. Rosenblum, A. R. Taubin and B. S. Tzirlin, Self-timed Control of Concurrent Processes, Kluwer, 1990 (Russian edn 1986).

  11. E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. R. Stephan, R. K. Brayton and A. Sangiovanni-Vincentelli, “SIS: A system for sequential circuit synthesis”, Technical Report UCB/ERL M92/41, University of California, Berkeley, May 1992.

  12. E. Pastor, O. Roig, J. Cortadella and R. Badia, “Petri net analysis using Boolean manipulation”, in 15th International Conference on Application and Theory of Petri Nets, pp. 416–435, Zaragoza, Spain, June 1994.

  13. D. E. Muller, “Asynchronous logics and application to information processing”, in Proceedings of the Symposium on Application of Switching Theory in Space Technology, pp. 289–297, Stanford University Press, 1963.

  14. M. Zhou and F. DiCesare, Petri Net Synthesis for Discrete Event Control of Manufacturing Systems, Kluwer, 1993.

  15. Proceedings of CESA'96 IMACS Multiconference, Computational Engineering in System Applications. Symposium on Discrete Events and Manufacturing Systems, IEEE-SMC, 1996.

  16. N. Cacutalua, On Deadlocks in Concurrent Systems: A Petri Net based Approach for Deadlock Prediction and Avoidance, GMD, 1993.

  17. M. Zhou (ed.), Petri Net in Flexible and Agile Automation, Kluwer, 1995.

Download references

Author information

Authors and Affiliations

  1. The University of Aizu, 965-80, Aizu-Wakamatsu, Japan

    A. Taubin & A. Kondratyev

  2. Strategic CAD Labs. Intel Corp., Hillsboro, OR, USA

    M. Kishinevsky

Authors
  1. A. Taubin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Kondratyev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Kishinevsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Taubin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Taubin, A., Kondratyev, A. & Kishinevsky, M. Deadlock prevention using Petri nets and their unfoldings. Int J Adv Manuf Technol 14, 750–759 (1998). https://doi.org/10.1007/BF01438227

Download citation

  • Issue Date:

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

Keywords

Search

Navigation