Abstract
This paper provides reduction rules that make it possible to reduce all and only live and bounded Free Choice Petri nets to a circuit containing one place and one transition. The reduction algorithm is shown to require polynomial time in the size of the system. The reduction rules can be transformed into synthesis rules, which can be used for the stepwise construction of large systems.
| Original language | English |
|---|---|
| Pages (from-to) | 50-87 |
| Number of pages | 38 |
| Journal | Information and Computation |
| Volume | 114 |
| Issue number | 1 |
| DOIs | |
| State | Published - Oct 1994 |
| Externally published | Yes |