PEP — more than a Petri Net tool

  • Bernd Grahlmann
  • Eike Best
Tool Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1055)


The PEP system (Programming Environment based on Petri Nets) supports the most important tasks of a good net tool, including HL and LL net editing and comfortable simulation facilities. In addition, these features are embedded in sophisticated programming and verification components. The programming component allows the user to design concurrent algorithms in an easy-to-use imperative language, and the PEP system then generates Petri nets from such programs. The PEP tool's comprehensive verification components allow a large range of properties of parallel systems to be checked efficiently on either programs or their corresponding nets. This includes user-defined properties specified by temporal logic formulae as well as specific properties for which dedicated algorithms are available. PEP has been implemented on Solaris 2.4, Sun OS 4.1.3 and Linux. Ftp-able versions are available.


B(PN)2 Model checking Parallel finite automata PEP Petri nets Process algebra Temporal logic Tool 


  1. [1]
    E. Best, R. Devillers and J. G. Hall. The Box Calculus: a New Causal Algebra with Multi-Label Communication. Advances in Petri Nets 92, LNCS Vol. 609, 21–69. Springer, 1992.Google Scholar
  2. [2]
    E. Best and H. Fleischhack, editors. PEP: Programming Environment Based on Petri Nets. Hildesheimer Informatik-Berichte 14/95. 1995.Google Scholar
  3. [3]
    E. Best, H. Fleischhack, W. Fraczak, R. P. Hopkins, H. Klaudel, and E. Pelz. An M-Net Semantics of B(PN)2. Proc. of STRICT, 85-100, Workshops in Computing. Springer, 1995.Google Scholar
  4. [4]
    E. Best, H. Fleischhack, W. Fraczak, R. P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. Proc. of ATPN'95, Torino, LNCS Vol. 935, 103–118. Springer, 1995.Google Scholar
  5. [5]
    E. Best and B. Grahlmann. PEP: Documentation and User Guide. UniversitÄt Hildesheim, /pub/Projekte/PEP/... or 1995.Google Scholar
  6. [6]
    E. Best and R. P. Hopkins. B(PN)2 — a Basic Petri Net Programming Notation. Proc. of PARLE, LNCS Vol. 694, 379–390. Springer, 1993.Google Scholar
  7. [7]
    E. Best and M. Koutny. A Refined View of the Box Calculus. Proc. of ATPN'95, Torino, LNCS Vol. 935, 103–118. Springer, 1995.Google Scholar
  8. [8]
    J. Esparza, S. Römer, and W. Vogler. An Improvement of McMillan's Unfolding Algorithm. Proc. of TACAS'96, 1996.Google Scholar
  9. [9]
    J. Esparza. Model Checking Using Net Unfoldings, 151–195. Number 23 in Science of Computer Programming. Elsevier, 1994.Google Scholar
  10. [10]
    B. Grahlmann, M. Moeller, and U. Anhalt. A New Interface for the PEP Tool — Parallel Finite Automata. Proc. of 2. Workshop Algorithmen und Werkzeuge für Petrinetze, AIS 22, 21–26. FB Informatik UniversitÄt Oldenburg, 1995.Google Scholar
  11. [11]
    B. Grahlmann. Verifying Telecommunication Protocols with PEP. Proc. of RELECTRONIC'95, Budapest, 251–256, 1995.Google Scholar
  12. [12]
    B. Graves. Ein Modelchecker für eine Linear-Time-Logik. Diplomarbeit, UniversitÄt Hildesheim, 1995.Google Scholar
  13. [13]
    L. Jenner. A Low-Level Net Semantics for B(PN)2 with Procedures. In [2].Google Scholar
  14. [14]
    S. Melzer. Design and Implementation of a C-Code Generator for B(PN)2. In [2].Google Scholar
  15. [15]
    W. Ruckdeschel and R. Onken. Petri Net Modelling, Analysis and Realtime-Simulation of Pilot Behaviour. Proc. of ATPN'95, 1995.Google Scholar
  16. [16]
    P. H. Starke. INA: Integrated Net Analyzer. Handbuch, 1992.Google Scholar
  17. [17]
    T. Thielke. Implementierung eines effizienten Modelchecking-Algorithmus. Petri-Netze im Einsatz für Entwurf und Entwicklung von Informationssystemen, 127–139. Springer, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Bernd Grahlmann
  • Eike Best
    • 1
  1. 1.Institut für InformatikUniversitÄt HildesheimHildesheim

Personalised recommendations