Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - Reduction and Synthesis of Live and Bounded Free Choice Petri Nets


J. Esparza. Reduction and synthesis of live and bounded free choice Petri nets. Information and Computation, 114(1):50–87, 1994.


This paper provides reduction rules that make it possible to reduce all and only live and bounded Free Choice Petri nets to 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.

Suggested BibTeX entry:

    author = {J. Esparza},
    journal = {{Information and Computation}},
    number = {1},
    pages = {50--87},
    title = {Reduction and Synthesis of Live and Bounded Free Choice {P}etri Nets},
    volume = {114},
    year = {1994}

PDF (3 MB)