Linear algebraic design of supervisors for partially observed Petri nets

摘要

The design of supervisors for Petri nets containing both uncontrollable and unobservable transitions is studied. The control goal is that the marking always satisfies a linear inequality, defining a so-called legal set. Supervisors are designed by using linear programming techniques. One only has to find the minimal — w.r.t. the componentwise partial order — vertices of a polyhedron. Moreover, the presented method allows to make an approximation of the worst-case uncontrollable behavior of the original Petri net without doing any reachability analysis.