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.
[1]
Bernd Grahlmann,et al.
A New Interface for the PEP Tool - Parallel Finite Automata
,
1995
.
[2]
Raymond R. Devillers,et al.
The box calculus: a new causal algebra with multi-label communication
,
1992,
Advances in Petri Nets: The DEMON Project.
[4]
Hanna Klaudel,et al.
An M-net Semantics of B(PN)2
,
1995,
STRICT.
[5]
Walter Vogler,et al.
An Improvement of McMillan's Unfolding Algorithm
,
1996,
Formal Methods Syst. Des..
[6]
Hanna Klaudel,et al.
A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2
,
1995,
Application and Theory of Petri Nets.
[7]
Javier Esparza.
Model Checking Using Net Unfoldings
,
1994,
Sci. Comput. Program..
[8]
Richard P. Hopkins,et al.
B(PN)2 - a Basic Petri Net Programming Notation
,
1993,
PARLE.