Abstract
PEP is a tool for the design, analysis and the verification of parallel programs. Two approaches are presented in this paper being the underlying technique of the verification component of PEP.
This work was supported by the Sonderforschungsbereich SFB-342 A3 — SAM.
Partially this work was done while the author was a member of the University of Hildesheim.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bernd Baumgarten. Petri-Netze. Grundlagen und Anwendungen. BI-Wissenschaftsverlag, 1990.
Eike Best. Esprit Basic Research Action 3148 DEMON (Design Methods Based on Nets) — Aims, Scope and Achievements. In Advances in Petri Nets, volume 609 of Lecture Notes in Computer Science, pages 1–20. Springer Verlag, 1992.
Eike Best, Raymond Devillers, and Jon G. Hall. The Box Calculus: A new causal Algebra with multi-label Communication. In Advances in Petri Nets 92, volume 609 of Lecture Notes in Computer Science, pages 21–69. Springer-Verlag, 1992.
Eike Best, Raymond Devillers, Elisabeth Pelz, Arend Rensink, Manuel Silva, and Enrique Teruel. Caliban — Esprit Basic Research WG 6067. In Structures in Concurrency Theory, Workshops in Computing, pages 2–31, Berlin, May 1995. Springer Verlag.
Eike Best and Hans Fleischhack. PEP: Programming Environment Based on Petri Nets. Hildesheimer Informatik Bericht 14/95, Universtät Hildesheim, May 1995.
Eike Best and Richard Pinder Hopkins. B(PN)2 — a Basic Petri Net Programming Notation. In Proceedings of PARLE '93, volume 694 of Lecture Notes in Computer Science, pages 379–390. Springer-Verlag, 1993.
P. Cousot and N.Halbwachs. Automatic discovery of linear restraints among variables of a program. In 5th ACM Symposium on Principles of Programming Languages. ACM-Press, 1978.
Javier Esparza. Model checking using net unfoldings. Science of Computer Programming 23, pp. 151–195 (1994).
Javier Esparza, Stefan Römer, and Walter Vogler. An Improvement of McMillan's Unfolding Algorithm. Sonderforschungsbericht 342/12/95 A, Technische Universtät München, München, August 1995. (to appear in the proceedings of TACAS '96).
Thom Frühwirth, Alexander Herold, Volker Küchenhoff, Thierry Le Provost, Pierre Lim, Eric Monfroy, and Mark Wallace. Constraint Logic Programming — An Informal Introduction. ECRC-93-5, European Computer-Industry Research Centre, München, 1993.
N. Halbwachs. About synchronous programming and abstract interpretation. In SAS '94: Static Analysis Symposium, volume 864 of Lecture Notes in Computer Science, pages 179–192. Springer-Verlag, 1994.
K. L. McMillan. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In 4th Workshop on Computer Aided Verification, pages 164–174, Montreal, 1992.
Stephan Melzer. Büchi Nets — A Pendant to Büchi Automata. Sonderforschungsbericht, Technische Universität, 1996. (in preparation).
Stephan Melzer and Javier Esparza. Checking system properties via integer programming. Sonderforschungsbericht 342/13/95 A, Technische Universität München, August 1995. (to appear in the proceedings of ESOP '96).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Melzer, S., Römer, S., Esparza, J. (1996). Verification using PEP. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014349
Download citation
DOI: https://doi.org/10.1007/BFb0014349
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61463-0
Online ISBN: 978-3-540-68595-1
eBook Packages: Springer Book Archive