Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
Download paper Adobe portable document format (pdf)
Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
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.
Keywords: Intentional transition systems, polynomials, symbolic bisimulations, model reduction, BDD, Supervisory control Problem
Hervé Marchand
hmarchan@irisa.fr
@TechReport{pinchinat99,
Author = {Pinchinat, S. and Marchand, H. and Le Borgne, M.},
Title = {Symbolic Abstractions of Automata and their application to the Supervisory Control Problem},
Number = {1279},
Institution = {Irisa},
Month = {November},
Year = {1999}
}
Get EndNote Reference (.ref)