PEP - More than a Petri net tool

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1055, Issue , 1996, Pages 397-401

  Grahlmann, Bernd ^a   Best, Eike ^a  

^a UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

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

Indexed keywords

ALGORITHMS; COMPUTER CIRCUITS; COMPUTER OPERATING SYSTEMS; PETRI NETS; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC; TOOLS;

CONCURRENT ALGORITHMS; IMPERATIVE LANGUAGES; PARALLEL SYSTEM; PROCESS ALGEBRAS; PROGRAMMING COMPONENTS; PROGRAMMING ENVIRONMENT; SOLARIS; SPECIFIC PROPERTIES;

MODEL CHECKING;

EID: 84958745273     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61042-1_58     Document Type: Conference Paper

References (17)

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.
2. E. Best and H. Fleischhack, editors. PEP: Programming Environment Based on Petri Nets. Hildesheimer lnformatik-Berichte 14/95. 1995.
3. E. Best, H. Fleischhack, W. Frączak, 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.
4. E. Best, H. Fleischhack, W. Frączak, R. P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable lqigh Level Petri Nets. Proc. of ATPN’95, Torino, LNCS Vol. 935, 103-118. Springer, 1995.
5. E. Best and B. Grahlmann. PEP: Documentation and User Guide. Universität Hildesheim. ftp.informatik.uni-hildesheim.de/pub/Projekte/PEP/…orhttp://www.informatik.uni-hildesheim.de/-pep/HomePage.html 1995.
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.
7. E. Best and M. Koutny. A Refined View of the Box Calculus. Proe. of ATPN’95, Torino, LNCS Vol. 935, 103-118. Springer, 1995.
8. J. Esparza, S. Römer, and W. Vogler. An Improvement of McMillan’s Unfolding Algorithm. Proc. of TA CAS’96, 1996.
9. J. Esparza. Model Checking Using Net Unfoldings, 151-195. Number 23 in Science of Computer Programming. Elsevier, 1994.
10. B. Grahlmann, M. Moeller, and U. Anhalt. A New Interface for the PEP Tool - Parallel Finite Automata. Proc. of 2. Workshop Algorlthmen und Werkzeuge für Petrinetze, AIS 22, 21-26. FB Informatik Universitat Oldenburg, 1995.
11. B. Grahlmann. Verifying Telecommunication Protocols with PEP. Proc. of RELECTRONIC’ 95, Budapest, 251-256, 1995.
12. B. Graves. Ein Modelehecker für eine Linear-Time-Logik. Diplomarbeit, Universität Hildesheim, 1995.
13. L. Jenner. A Low-Level Net Semantics for B(PN) 2 with Procedures. In [2].
14. S. Melzer. Design and Implementation of a C-Code Generator for B(PN) 2, In [2].
15. W. Ruckdeschel and R. Onken. Petri Net Modelling, Analysis and Realtime- Simulation of Pilot Behaviour. Proc. of ATPN’95, 1995.
16. P. H. Starke. INA: Integrated Net Analyzer. Handbuch, 1992.
17. T. Thielke. lmplementierung eines effizienten Modelchecking-Algorithmus. Petri- Netze im Einsatz für Entwurf und Entwieklung yon lnformationssystemen, 127-139. Springer, 1993.