Abstract
This paper presents a novel analytical method for soundness verification of workflow nets and reset workflow nets, using the well-known stability results of Lyapunov for Petri nets. We also prove that the soundness property is decidable for workflow nets and reset workflow nets. In addition, we provide evidence of several outcomes related with properties such as boundedness, liveness, reversibility and blocking using stability. Our approach is validated theoretically and by a numerical example related to traffic signal-control synchronisation.
| Original language | English |
|---|---|
| Pages (from-to) | 43-57 |
| Number of pages | 15 |
| Journal | Journal of Experimental and Theoretical Artificial Intelligence |
| Volume | 29 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2 Jan 2017 |
Keywords
- Lyapunov stability
- Petri nets
- Workflow nets
- decidability
- soundness
- traffic signal-control
- verification