The PEP tool embeds sophisticated programming and verification components in a user-friendly graphical interface. The basic idea is that the programming component allows the user to design concurrent algorithms in an imperative language, and that the PEP system then generates Petri nets from such programs in order to use Petri net theory for simulation and verification purposes. A key feature is flexibility; its modular design eases the task of adding new interfaces to other verification packages, such as ‘INA’, ‘PROD’ or ‘SMV’. PEP has been implemented on Solaris 2.x, Sun OS 4.1.x and Linux. Ftp-able versions are available via http://www.informatik.uni-hildesheim.de/ pep.
Keywords for this software
References in zbMATH (referenced in 11 articles )
Showing results 1 to 11 of 11.
- Eshuis, Rik: Statechartable Petri nets (2013)
- Haar, Stefan; Kern, Christian; Schwoon, Stefan: Computing the reveals relation in occurrence nets (2013)
- Devillers, Raymond; Klaudel, Hanna; Koutny, Maciej: A compositional Petri net translation of general $\pi$-calculus terms (2008)
- Klaudel, Hanna; Pommereau, Franck: M-nets: a survey (2008)
- Behrens, Tristan M.; Dix, Jürgen: Model checking multi-agent systems with logic based Petri nets (2007)
- Khomenko, Victor; Koutny, Maciej: Verification of bounded Petri nets using integer programming (2007)
- Devillers, Raymond; Klaudel, Hanna; Riemann, Robert-C.: General parameterised refinement and recursion for the M-net calculus (2003)
- Thanh, C.Bui; Klaudel, H.; Pommereau, F.: Petri nets with causal time for system verification (2003)
- Stehno, Christian: Real-time systems design with PEP (2002)
- Best, Eike: Partial order verification with PEP (1997)
- Kindler, Ekkart; Reisig, Wolfgang; Völzer, Hagen; Walter, Rolf: Petri net based verification of distributed algorithms: An example (1997)