Skip to main content
SpringerLink
Log in

Unfoldings of Bounded Hybrid Petri Nets

  • Conference paper
Computer Aided Systems Theory – EUROCAST 2011 (EUROCAST 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6927))

Included in the following conference series:

Abstract

The unfolding is a useful partial-order based method for analysis and verification of the Petri net properties. This technique can cope well with the so-called state space explosion problem, especially for the Petri nets with a lot of concurrency. The paper formalizes the concept of the unfolding for bounded hybrid Petri nets and introduces the algorithm for its computing.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Reisig, W.: Petri Nets - an Introduction, Berlin (1985)

    Google Scholar 

  2. Desel, J., Juhás, G.: What Is a Petri Net? In: Ehrig, H., Juhás, G., Padberg, J., Rozenberg, G. (eds.) Unifying Petri Nets 2001. LNCS, vol. 2128, pp. 1–25. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. David, R., Alla, H.: Continuous Petri nets. In: Proc. of the 8th European Workshop on Application an Theory of Petri Nets, Zaragoza, Spain, pp. 275–294 (1987)

    Google Scholar 

  4. Recalde, L., Teruel, E., Silva, M.: Autonomous Continuous P/T Systems. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 107–126. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. David, R., Alla, H.: Continuous and hybrid Petri nets. Journal of Circuits, Systems, and Computers (1998)

    Google Scholar 

  6. David, R., Alla, H.: Discreet, Continuous and hybrid Petri nets. Springer, Berlin (2005)

    Google Scholar 

  7. McMillan, K.L.: A Technique of State Space Search Based on Unfolding. In: Formal Methods in System Design, vol. 6, pp. 45–65 (1995)

    Google Scholar 

  8. Esparza, J., Romer, S., Vogler, W.: An Improvement of McMillan’s Unfolding Algorithm. In: Formal Methods in System Design, vol. 20 (2002)

    Google Scholar 

  9. Esparza, J., Heljanko, K.: Unfoldings - a partial-order approach to model checking. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  10. Khomenko, V., Koutny, M.: Towards An Efficient Algorithm for Unfolding Petri Nets. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 366–380. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Weidlich, M., Elliger, F., Weske, M.: Generalised computation of behavioural profiles based on petri-net unfoldings. In: Bravetti, M. (ed.) WS-FM 2010. LNCS, vol. 6551, pp. 101–115. Springer, Heidelberg (2011)

    Google Scholar 

  12. Valmari, A.: The State Explosion Problem. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models 1998. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  13. Novosad, P., Češka, M.: Algorithms for Computing Coverability Graphs for Hybrid Petri Nets. In: MEMICS, pp. 177–183. MUNI, Brno (2008)

    Google Scholar 

  14. Desel, J., Juhás, G., Neumair, C.: Finite Unfoldings of Unbounded Petri Nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 157–176. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Technology, Brno University of Technology, Božetěchova 2, 612 66, Brno, Czech Republic

    Petr Novosad & Milan Češka

Authors
  1. Petr Novosad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Milan Češka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto Universitario de Ciencias y Tecnologías Cibernéticas, Universidad de Las Palmas de Gran Canaria, Campus de Tafira, 35017, Las Palmas de Gran Canaria, Spain

    Roberto Moreno-Díaz  & Alexis Quesada-Arencibia  & 

  2. Institute of Systems Science, Johannes Kepler University Linz, Altenbergerstrasse 69, 4040, Linz, Austria

    Franz Pichler

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Novosad, P., Češka, M. (2012). Unfoldings of Bounded Hybrid Petri Nets. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27549-4_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27549-4_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27548-7

  • Online ISBN: 978-3-642-27549-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation