Hierarchical supervisory control of complex Petri nets

Large, complex systems are prone to the phenomenon of livelocks. Once a system enters a livelocked-state, there is at least one activity of the modeled system that cannot be executed from all subsequent states of the system. This phenomenon is common to many operating systems where some process enters into a state of suspended animation for all perpetuity, and the user is left with no other option than to forcibly kill the suspended job, or reboot the machine. This thesis is about finding supervisory control policies that enforce livelock-freedom in large complex systems that are modeled using Petri nets. The supervisory policy, when it exists, prevents the occurrence of certain events (i.e. activities) at specific states in such a way that the supervised system is livelock free. A hierarchical approach is used to find a supervisory policy for petri nets. This theory finds application for concurrent systems like computer operating systems which are complex to analyze. The complex system is (recursively) represented as the combination of two smaller systems. Under favorable conditions identified in this thesis, local supervisory policies that enforces livelock-freedom in each of the smaller systems will suffice to enforce livelock-freedom in the larger system.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Aerospace Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2012

Author dc:creator

• Somnath, Nisha

Contributors dc:contributor

• Sreenivas, Ramavarapu S.

• Petri nets
• Supervisory control
• Concurrent systems

Statement dc:rights

• Copyright 2011 Nisha Somnath

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/29638

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/29638