Analysis of Petri Nets and Transition Systems

Eike Best
Uli Schlachter

This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent, dedicated algorithms which have been designed to operate modularly, portably, extensibly, and efficiently.

In Sophia Knight, Ivan Lanese, Alberto Lluch Lafuente and Hugo Torres Vieira: Proceedings 8th Interaction and Concurrency Experience (ICE 2015), Grenoble, France, 4-5th June 2015, Electronic Proceedings in Theoretical Computer Science 189, pp. 53–67.
Published: 19th August 2015.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: