BEGMRW97
E. Best, J. Esparza, B. Grahlmann, S. Melzer, S. Römer, and F. Wallner.
The PEP verification system.
In FEmSys'97, 1997.
Tool presentation. [gzipped Postscript ] [Abstract]

ER99
J. Esparza and S. Römer.
An unfolding algorithm for synchronous products of transition systems.
In Proc. of CONCUR'99, number 1664, pages 2-20. Springer-Verlag, 1999. [gzipped Postscript ] [Abstract]

ERV96
J. Esparza, S. Römer, and W. Vogler.
An improvement of McMillan's unfolding algorithm.
In T. Margaria and B. Steffen, editors, Proc. of TACAS'96, number 1055 in Lecture Notes in Computer Science, pages 87-106. Springer-Verlag, 1996. [gzipped Postscript ] [Abstract]

ERV01
J. Esparza, S. Römer, and W. Vogler.
An improvement of McMillan's unfolding algorithm.
Formal Methods in System Design, 2001.
To appear. [gzipped Postscript ] [Abstract]

MR97a
S. Melzer and S. Römer.
Deadlock checking using net unfoldings.
In Proc. of the Conf. on Computer-Aided Verfication (CAV'97), 1997. [gzipped Postscript ] [Abstract]

MRE96
S. Melzer, S. Römer, and J. Esparza.
Verification using PEP (tool presentation).
In M. Wirsing and M. Nivat, editors, Proc. of AMAST'96, number 1101 in Lecture Notes in Computer Science, pages 591-594. Springer-Verlag, 1996. [gzipped Postscript ] [Abstract]

Roe00b
S. Römer.
Entwicklung und Implementierung von Verifikationstechniken auf der Basis von Netzentfaltungen.
PhD thesis, Technische Universität München, 2000.

RM96
S. Römer and S. Melzer.
Synchronisierende Automaten in PEP.
Technical Report 341, AIFB, Universität Karlsruhe, October 1996. [gzipped Postscript ] [Abstract]