Skip to main content
SpringerLink
Log in

All True Concurrency Models Start with Petri Nets: A Personal Tribute to Carl Adam Petri

  • Chapter
  • First Online:
Carl Adam Petri: Ideas, Personality, Impact

  • 441 Accesses

Abstract

The author discusses some features of verification that are specific for Petri nets, in particular model abstraction techniques, partial order reductions, and SAT-based bounded model checking methods for (time) Petri nets.

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 49.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. R. Alur, C. Courcoubetis, D. Dill, Model checking in dense real-time. Inf. Comput. 104(1), 2–34 (1993)

    Article  MathSciNet  Google Scholar 

  2. A. Janowska, W. Penczek, A. Półrola, A. Zbrzezny, Using integer time steps for checking branching time properties of time Petri nets. in Trans. Petri Nets and Other Models of Concurrency, ed. by M. Koutny, W.M.P. van der Aalst, A. Yakovlev. LNCS, vol. 8100(8) (Springer, Berlin, 2013), pp. 89–105

    Chapter  Google Scholar 

  3. M. Knapik, A. Niewiadomski, W. Penczek, A. Półrola, M. Szreter, A. Zbrzezny, Parametric model checking with VerICS, in Trans. Petri Nets and Other Models of Concurrency, ed. by M. Knapik et al. LNCS, vol. 6550(4) (Springer, Berlin, 2010), pp. 98–120

    Chapter  Google Scholar 

  4. M. Knapik, M. Szreter, W. Penczek, Bounded parametric model checking for elementary net systems, in Trans. Petri Nets and Other Models of Concurrency, ed. by M. Knapik et al. LNCS, vol. 6550(4), 42–71 (Springer, Berlin, 2010)

    Chapter  Google Scholar 

  5. A. Mazurkiewicz. Trab theory, in Advances in Petri Nets 1986, ed. by W. Braner, W. Reisig, G. Rozenberg. LNCS, vol. 255 (Springer, Berlin, 1986), pp. 279–324

    Google Scholar 

  6. A. Mȩski, W. Penczek, A. Półrola, BDD-based bounded model checking for temporal properties of 1-safe Petri nets. Fundam. Inform. 109(3), 305–321 (2011)

    Google Scholar 

  7. A. Mȩski, A. Półrola, W. Penczek, B. Woźzna-Szcześniak, A. Zbrzezny, Bounded model checking approaches for verification of distributed time Petri nets, in Proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE’11) (2011), pp. 72–91

    Google Scholar 

  8. W. Penczek, A. Półrola, Abstractions and partial order reductions for checking branching properties of time Petri nets, in Proceedings of the 22nd International Conference on Applications and Theory of Petri Nets (ICATPN’01), ed. by J.M. Colom, M. Koutny. LNCS, vol. 2075 (Springer, Berlin, 2001), pp. 323–342

    Google Scholar 

  9. W. Penczek, A. Półrola, Specification and model checking of temporal properties in time Petri nets and timed automata, in Proceedings of the 25th International Conference on Applications and Theory of Petri Nets (ICATPN ’04), ed. by J. Cortadella, W. Reisig. LNCS, vol. 3099 (Springer, Berlin, 2004), pp. 37–76

    MATH  Google Scholar 

  10. W. Penczek, A. Półrola, Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. Studies in Computational Intelligence, vol. 20 (Springer, Berlin, 2006)

    Book  Google Scholar 

  11. W. Penczek, A. Półrola, A. Zbrzezny, SAT-based (parametric) reachability for a class of distributed time Petri nets, in Trans. Petri Nets and Other Models of Concurrency, ed. by M. Knapik et al. LNCS, vol. 6550(4) (Springer, Berlin, 2010), pp. 72–97

    Chapter  Google Scholar 

  12. A. Półrola, W. Penczek, Minimization algorithms for time Petri nets. Fundam. Inform. 60(1–4), 307–331 (2004)

    MathSciNet  MATH  Google Scholar 

  13. A. Półrola, P. Cybula, A. Meski, SMT-based reachability checking for bounded time Petri nets. Fundam. Inform. 135(4), 467–882 (2014)

    MathSciNet  MATH  Google Scholar 

  14. A. Zbrzezny, SAT-based reachability checking for timed automata with diagonal constraints. Fundam. Inform. 67(1–3), 303–322 (2005)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The author is grateful to Dr. Agata Półrola for reading and commenting on this paper, which is mainly based on the joint book [10] and joint research.

Author information

Authors and Affiliations

  1. Institute of Computer Science, PAS, Warsaw, Poland

    Wojciech Penczek

  2. Siedlce University of Natural Sciences and Humanities, Institute of Computer Science (ICS), Siedlce, Poland

    Wojciech Penczek

Authors
  1. Wojciech Penczek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wojciech Penczek .

Editor information

Editors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, Berlin, Germany

    Wolfgang Reisig

  2. Leiden Institute of Advanced Computer Science, Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Penczek, W. (2019). All True Concurrency Models Start with Petri Nets: A Personal Tribute to Carl Adam Petri. In: Reisig, W., Rozenberg, G. (eds) Carl Adam Petri: Ideas, Personality, Impact. Springer, Cham. https://doi.org/10.1007/978-3-319-96154-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-96154-5_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-96153-8

  • Online ISBN: 978-3-319-96154-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation