Síntese de supervisores através de verificação de modelo.

Abstract

Petri nets have been extensively used to the modeling, analysis and control of discrete event systems. Nowadays different researchers use supervisory control theory together with aiming at the synthesis of supervisors for discrete event systems. Many approaches have been proposed in order to solve the synthesis problem, but all them face the problem of state explosion. This work introduces an algorithm to the synthesis of the supervisor for discrete event systems based on symbolic model checking. The introduced algorithm is validated using two different computational tools, namely PEP (Pragramming Enviroment based Petri Nets) and SMV (Simbolic Model Verifier). Model checking is carried on based on a Ordered Binary Decision Diagrams, that allow a compact representation of the state space based on boolean expressions. Also, in this work we apply the algorithm to two different production systems examples.