## Symbolic abstractions of automata and their application to the supervisory control problem (1999)

Citations: | 4 - 2 self |

### BibTeX

@TECHREPORT{Pinchinat99symbolicabstractions,

author = {S. Pinchinat and H. Marchand and M. Le Borgne},

title = {Symbolic abstractions of automata and their application to the supervisory control problem},

institution = {},

year = {1999}

}

### OpenURL

### Abstract

In this report, we describe the design of abstraction methods based on symbolic techniques: classical abstraction by state fusion has been considered. we present a general method to abstract automata on the basis of a state fusion criterion, derived from e.g. equivalence relations (such as bisimulation), partitions,... We also introduced other kinds of abstraction, falling into the category of abstraction by restriction: in particular, we studied the use of the controller synthesis methodology to achieve the restriction synthesis. The methods rely on symbolic representation of the labeled transition system, namely the Intensional Labeled Transition System (ILTS). It is a behavioral model for Discrete event systems based on polynomial approach, that has e ective applications for the analysis of Signal programs. We finally apply this methodology to solve the Supervisory Control Problem.