Reduction and synthesis of live and bounded free choice petri nets

Research output: Contribution to journalArticlepeer-review

38 Scopus citations

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 languageEnglish
Pages (from-to)50-87
Number of pages38
JournalInformation and Computation
Volume114
Issue number1
DOIs
StatePublished - Oct 1994
Externally publishedYes

Fingerprint

Dive into the research topics of 'Reduction and synthesis of live and bounded free choice petri nets'. Together they form a unique fingerprint.

Cite this