{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/50715"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/50715","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Disjunctive normal formula based supervisory control policy for general Petri nets","abstract":"A Petri net (PN) is said to be live if it is possible to re any transition, although not immediately, from every reachable marking. A liveness enforcing supervisory policy (LESP) determines which controllable transition is to be prevented from ring at a marking, to ensure the supervised Petri net (PN) is live. A LESP is said to be minimally restrictive if the following property is true { if a minimally restrictive LESP prevents the ring of a transition at a marking, then all other LESPs should do the same. We restrict our attention to a class of general Petri nets (PN) structures, where the existence of an LESP for an instance initialized at a marking, implies the existence of an LESP when the same instance is initialized with a larger initial marking. We show that the minimally restrictive LESP for an instance N from this class is characterized by a collection of boolean formulae f tc(N)gtc2Tc , where Tc is the set of controllable transitions in the PN. The literals in tc(N) are true if and only if the token-load of speci c places meet a threshold. Consequently, appropriately placed threshold-sensors, which detect if the token-load of a place is greater than or equal to a predetermined threshold, provide su cient information to implement the minimally restrictive LESP.","abstract_html":"A Petri net (PN) is said to be live if it is possible to re any transition, although not immediately, from every reachable marking. A liveness enforcing supervisory policy (LESP) determines which controllable transition is to be prevented from ring at a marking, to ensure the supervised Petri net (PN) is live. A LESP is said to be minimally restrictive if the following property is true { if a minimally restrictive LESP prevents the ring of a transition at a marking, then all other LESPs should do the same. We restrict our attention to a class of general Petri nets (PN) structures, where the existence of an LESP for an instance initialized at a marking, implies the existence of an LESP when the same instance is initialized with a larger initial marking. We show that the minimally restrictive LESP for an instance N from this class is characterized by a collection of boolean formulae f tc(N)gtc2Tc , where Tc is the set of controllable transitions in the PN. The literals in tc(N) are true if and only if the token-load of speci c places meet a threshold. Consequently, appropriately placed threshold-sensors, which detect if the token-load of a place is greater than or equal to a predetermined threshold, provide su cient information to implement the minimally restrictive LESP.","abstract_has_math":false,"creators":["Deverakonda, Vijayalakshmi"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Industrial Engineering","degree_department":null,"school":null,"contributors":["Sreenivas, Ramavarapu S."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-09-16T17:25:36Z","date_published":"2014-09-16T17:25:36Z","updated_at":"2026-07-22T22:25:41Z","subjects":["Petri Nets"],"languages":["en"],"rights":["Copyright 2014 Vijayalakshmi Deverakonda"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/50715","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Sreenivas, Ramavarapu S."]},{"key":"dc:creator","label":"Author","values":["Deverakonda, Vijayalakshmi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-09-16T17:25:36Z","2014-08","2014-09-16"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Petri Nets"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2014 Vijayalakshmi Deverakonda"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/50715"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A Petri net (PN) is said to be live if it is possible to re any transition, although not immediately, from every reachable marking. A liveness enforcing supervisory policy (LESP) determines which controllable transition is to be prevented from ring at a marking, to ensure the supervised Petri net (PN) is live. A LESP is said to be minimally restrictive if the following property is true { if a minimally restrictive LESP prevents the ring of a transition at a marking, then all other LESPs should do the same. We restrict our attention to a class of general Petri nets (PN) structures, where the existence of an LESP for an instance initialized at a marking, implies the existence of an LESP when the same instance is initialized with a larger initial marking. We show that the minimally restrictive LESP for an instance N from this class is characterized by a collection of boolean formulae f tc(N)gtc2Tc , where Tc is the set of controllable transitions in the PN. The literals in tc(N) are true if and only if the token-load of speci c places meet a threshold. Consequently, appropriately placed threshold-sensors, which detect if the token-load of a place is greater than or equal to a predetermined threshold, provide su cient information to implement the minimally restrictive LESP.","Item withdrawn by Laura Spradlin (lspradl2@illinois.edu) on 2014-06-24T20:53:16Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Deverakonda_Vijayalakshmi.pdf: 1443216 bytes, checksum: d6baf08efbf1afa454d31681fd35fbf4 (MD5)","Made available in DSpace on 2014-09-16T17:25:36Z (GMT). No. of bitstreams: 2 Vijayalakshmi_Deverakonda.pdf: 1443216 bytes, checksum: d6baf08efbf1afa454d31681fd35fbf4 (MD5) license.txt: 4075 bytes, checksum: 3d75fb1ce80d2cf6a10be0081d12a93e (MD5)"]},{"key":"dc:title","label":"Title","values":["Disjunctive normal formula based supervisory control policy for general Petri nets"]}]}],"canonical_facts":{"dc:contributor":["Sreenivas, Ramavarapu S."],"dc:creator":["Deverakonda, Vijayalakshmi"],"dc:date":["2014-09-16T17:25:36Z","2014-08","2014-09-16"],"dc:description":["A Petri net (PN) is said to be live if it is possible to re any transition, although not immediately, from every reachable marking. A liveness enforcing supervisory policy (LESP) determines which controllable transition is to be prevented from ring at a marking, to ensure the supervised Petri net (PN) is live. A LESP is said to be minimally restrictive if the following property is true { if a minimally restrictive LESP prevents the ring of a transition at a marking, then all other LESPs should do the same. We restrict our attention to a class of general Petri nets (PN) structures, where the existence of an LESP for an instance initialized at a marking, implies the existence of an LESP when the same instance is initialized with a larger initial marking. We show that the minimally restrictive LESP for an instance N from this class is characterized by a collection of boolean formulae f tc(N)gtc2Tc , where Tc is the set of controllable transitions in the PN. The literals in tc(N) are true if and only if the token-load of speci c places meet a threshold. Consequently, appropriately placed threshold-sensors, which detect if the token-load of a place is greater than or equal to a predetermined threshold, provide su cient information to implement the minimally restrictive LESP.","Item withdrawn by Laura Spradlin (lspradl2@illinois.edu) on 2014-06-24T20:53:16Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Deverakonda_Vijayalakshmi.pdf: 1443216 bytes, checksum: d6baf08efbf1afa454d31681fd35fbf4 (MD5)","Made available in DSpace on 2014-09-16T17:25:36Z (GMT). No. of bitstreams: 2 Vijayalakshmi_Deverakonda.pdf: 1443216 bytes, checksum: d6baf08efbf1afa454d31681fd35fbf4 (MD5) license.txt: 4075 bytes, checksum: 3d75fb1ce80d2cf6a10be0081d12a93e (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/50715"],"dc:language":["en"],"dc:rights":["Copyright 2014 Vijayalakshmi Deverakonda"],"dc:subject":["Petri Nets"],"dc:title":["Disjunctive normal formula based supervisory control policy for general Petri nets"],"dc:type":["text"],"thesis:degree_discipline":["Industrial Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:41Z"}