Analysis of Petri Nets and Transition Systems
Logic in Computer Science
2015-08-21 v1
Abstract
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.
Cite
@article{arxiv.1508.04851,
title = {Analysis of Petri Nets and Transition Systems},
author = {Eike Best and Uli Schlachter},
journal= {arXiv preprint arXiv:1508.04851},
year = {2015}
}
Comments
In Proceedings ICE 2015, arXiv:1508.04595