Skip to main content

The State of PEP

  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1548))

Abstract

The PEP tool can be considered to be one of the most widely distributed Petri net based tools. A continuously increasing functionality and an adequate graphical user interface may have been good reasons for its acceptance. Currently the tool contains approximately 500,000 lines of source code, and supports (to the best of our knowledge) the widest variety of input formalisms and verification methods of all verification tools. We briefly review the most recent developments. Ftp-able versions of the tool and PEP related papers are available via http://theoretica.informatik.uni-oldenburg.de/~pep.

PEP has been a joint project between the ‘Universität Hildesheim’, the ‘Carl-von-Ossietzky Universität Oldenburg’ and the ‘Humboldt-Universität zu Berlin’ which has been financed by the DFG (German Research Foundation).

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

Access this chapter

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. E. Best, R. Devillers, and J. G. Hall. The Box Calculus: a New Causal Algebra with Multi-Label Communication. In APN’92, LNCS 609, 21–69. Springer, 1992.

    Google Scholar 

  2. E. Best, H. Fleischhack, W. Frcaczak, R. P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. In Proc. of ATPN’95, LNCS 935, 103–118. Springer, 1995.

    Google Scholar 

  3. E. Best and B. Grahlmann. PEP: Documentation and User Guide. Universität Hildesheim. Available together with the tool via: http://theoretica.informatik.uni-oldenburg.de/~pep.

  4. E. Best and R. P. Hopkins. B(PN)2-a Basic Petri Net Programming Notation. In Proc. of PARLE, LNCS 694, 379–390, Springer, 1993.

    Google Scholar 

  5. A. Bouali, A. Ressouche, V. Roy, and R. de Simone. The FC2tools Set. In Proc. of CAV’96, LNCS 1102, 441–444, Springer, 1996.

    Google Scholar 

  6. CCITT. Specification and Description Language, CCITT Z.100, Geneva, 1992.

    Google Scholar 

  7. E. Clarke, K. McMillan, S. Campos, and V. Hartonas-Garmhausen. Symbolic Model Checking. In Proc. of CAV’96, LNCS 1102, 419–422, Springer, 1996.

    Google Scholar 

  8. J. Esparza, S. Römer, and W. Vogler. An Improvement of McMillan’s Unfolding Algorithm. In Proc. of TACAS’96, LNCS 1055, 87–106, Springer, 1996.

    Google Scholar 

  9. J. Esparza. Model Checking Using Net Unfoldings. In Number 23 in Science of Computer Programming, 151–195, Elsevier, 1994.

    Google Scholar 

  10. H. Fleischhack and B. Grahlmann. A Compositional Petri Net Semantics for SDL. In Proc. of ATPN’98, LNCS 1420, 144–164, Springer, 1998.

    Google Scholar 

  11. B. Grahlmann, M. Moeller, and U. Anhalt. A New Interface for the PEP Tool-Parallel Finite Automata. In Proc. of AWPN’95, AIS 22, 21-26. FB 10 Universität Oldenburg, 1995.

    Google Scholar 

  12. B. Grahlmann and C. Pohl. Profiting from Spin in PEP. In Proc. of the SPIN’98 Workshop, 1998.

    Google Scholar 

  13. B. Grahlmann. The Reference Component of PEP. In Proc. of TACAS’97, LNCS 1217, 65–80, Springer, 1997.

    Google Scholar 

  14. B. Grahlmann. Combining Finite Automata, Parallel Programs and SDL using Petri Nets. In Proc. of TACAS’98, LNCS 1384, 102–117, Springer, 1998.

    Google Scholar 

  15. B. Grahlmann. Parallel Programs as Petri Nets. Ph.D. thesis, Universität Hildesheim, 1998.

    Google Scholar 

  16. B. Graves. Computing Reachability Properties Hidden in Finite Net Unfoldings. In Proc. of FST&TCS’97, LNCS 1346, 327–341, Springer. 1997.

    Google Scholar 

  17. J. Jäger. Portable Codegenerierung für eine parallele Programmiersprache. Diploma thesis, Universität Hildesheim, 1997.

    Google Scholar 

  18. G. J. Holzmann and D. Peled. The State of SPIN. In Proc. of CAV’96, LNCS 1102, 385–389. Springer, 1996.

    Google Scholar 

  19. M. Kater. SimPEP: 3D-Visualisierung und Animation paralleler Prozesse. Diploma thesis, Universität Hildesheim, 1998.

    Google Scholar 

  20. S. Melzer and J. Esparza. Checking System Properties via Integer Programming. In Proc. of ESOP’96, LNCS 1058, 250–264, Springer, 1996.

    Google Scholar 

  21. S. Melzer and S. Römer. Deadlock Checking using Net Unfoldings. In Proc. of CAV’97, LNCS 1254, 352–363, Springer, 1997.

    Google Scholar 

  22. S. Roch and P. H. Starke. INA: Integrated Net Analyzer Version 2.1 Handbuch. Humboldt-Universität zu Berlin, 1998. Available together with the tool via: http://www.informatik.hu-berlin.de/lehrstuehle/automaten/ina.

  23. G. Wimmel. A BDD-based Model Checker for the PEP Tool. Technical Report, University of Newcastle upon Tyne, 1997. Available at PEP’s Web page.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grahlmann, B. (1998). The State of PEP. In: Haeberer, A.M. (eds) Algebraic Methodology and Software Technology. AMAST 1999. Lecture Notes in Computer Science, vol 1548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49253-4_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-49253-4_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65462-9

  • Online ISBN: 978-3-540-49253-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics