Skip to Main Content
A method for synthesizing feedback control logic for live and safe marked graphs has been given by Holloway and Krogh. The method strongly depends on the structure of marked graphs, and thus it has not been extended to wider classes. This paper considers the same problem of synthesizing the maximal permissive feedback control for a special condition by using unfoldings. Structural characteristics of unfoldings are similar to that of marked graphs. Transforming a Petri net to an unfolding allows us to apply the Holloway's approach to general bounded Petri nets.