Petri net based modeling and analysis of switched systems

Summarizes results for a class of timed Petri nets called programmable timed Petri nets (PTPN) (Lemon et al., 1988). The application of results concerning the uniform ultimate boundedness of switched systems, modeled by PTPN, is discussed. Unfolding is introduced as an efficient way to identify fundamental cycles from the reachability graph of the PTPN thereby providing an efficient way to test uniform ultimate boundedness of switched systems.