This paper introduces the tool Cycle. The core functionality of Cycln is to determine for a transition t of an unbounded Petri net whether or not t stops the net. A transition t stops the net (and is called a stop-transition) if each reachable marking of the net enables only finite occurrence sequences without occurrences of t. Cycln provides a graphical user interface which also illustrates the graph structures leading to the computed result. This way, results are explained in a comprehensible manner, and the user gets a visual explanation of the cyclic behavior of the net causing these results.
CITATION STYLE
Desel, J., Finthammer, M., & Frank, A. (2020). Cycl$$\mathbf {\circlearrowright }$$n – A Tool for Determining Stop-Transitions of Petri Nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12152 LNCS, pp. 392–402). Springer. https://doi.org/10.1007/978-3-030-51831-8_20
Mendeley helps you to discover research relevant for your work.