Síntese de supervisores de sistemas a eventos discretos temporizados e não temporizados.

Abstract

This thesis presents an alternative formulation for discrete event systems supervisor synthesis using dioid algebra. Both system model and behavior specification are interpreted as incidence matrix. The supervisor synthesis is realized through algebraic operations of the dioid algebra. The result found with this formalization are similar to the obtained result with supremal controllable sublanguage classical algorithm. The computational complexity of the proposed algorithm is equal to the classical algorithm complexity. The presented formalization allows extend the problem formulation to include a temporal representation and proceed to the timed discrete event systems supervisor synthesis. This extension utilizes the timed automaton, called (max,+)-automaton, to represent discrete event systems. In analogous way to the untimed case, both system model and behavior specification are represented by incidence matrices defined in the (max,+)-algebra. The class of discrete event systems that can be treaty with the presented formalism is restricted to the case which the event lifetime is specified in accordance to real number that is interpreted as a minimum time to event enabling. I n this way, the proposed approaching determines a unified formulation for the dealing of these systems.