Cargando…
Cycl[Formula: see text]n – A Tool for Determining Stop-Transitions of Petri Nets
This paper introduces the tool Cycl[Formula: see text]n . The core functionality of Cycl[Formula: see text]n 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 ne...
Autores principales: | Desel, Jörg, Finthammer, Marc, Frank, Andrea |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7324235/ http://dx.doi.org/10.1007/978-3-030-51831-8_20 |
Ejemplares similares
-
On the High Complexity of Petri Nets [Formula: see text]-Languages
por: Finkel, Olivier
Publicado: (2020) -
Free choice Petri nets
por: Desel, Jörg, et al.
Publicado: (2005) -
Transactions on petri nets and other models of concurrency X
por: Koutny, Maciej, et al.
Publicado: (2015) -
Transactions on petri nets and other models of concurrency XI
por: Koutny, Maciej, et al.
Publicado: (2016) -
Transition Property for [Formula: see text]-Power Free Languages with [Formula: see text] and [Formula: see text] Letters
por: Rukavicka, Josef
Publicado: (2020)