HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Symbolic Abstractions of Automata and their application to the Supervisory Control Problem

Sophie Pinchinat 1 Hervé Marchand 1 Michel Le Borgne 1
1 EP-ATR - Environnement de programmation d'applications temps réel
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
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 effective applications for the analysis of Signal programs. We finally apply this methodology to solve the Supervisory Control Problem.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:05:02 AM
Last modification on : Friday, February 4, 2022 - 3:21:57 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:08:05 PM


  • HAL Id : inria-00072844, version 1


Sophie Pinchinat, Hervé Marchand, Michel Le Borgne. Symbolic Abstractions of Automata and their application to the Supervisory Control Problem. [Research Report] RR-3814, INRIA. 1999. ⟨inria-00072844⟩



Record views


Files downloads