Reachability for a Class of Sequential Control Problems
1992 (English)Report (Other academic)
Of all control related problems within industry, those of sequential character are particularly common. Almost all industrial plants contain sequential parts; startup or shutdown phases are typical examples of this. Despite its importance fairly little theoretical research has been devoted to this problem. We study a subclass of sequential control problems, which we call the SAS-PUBS class. For this class of problems we give a reachability criterion. The complexity of checking if the criterion is fulfilled only increases polynomially with the number of state variables.
Place, publisher, year, edition, pages
Linköping: Linköping University , 1992.
LiTH-ISY-I, ISSN 8765-4321 ; 1434
Planning, Sequential control, Reachability
IdentifiersURN: urn:nbn:se:liu:diva-55574OAI: oai:DiVA.org:liu-55574DiVA: diva2:316343