Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-02-02
Computer Science
Formal Languages and Automata Theory
l'article pr\'esent\'e \`a 6 pages
Scientific paper
In this paper, we introduce the problem of synthesizing optimal controllers for discrete event systems and we propose a procedure for solving this problem, where the method and specifications are represented by finite state automata and with increasing complexity. We will subscribe to the synthetic methodology by the control theory initiated by supervision by Ramadge and Wonham. For an illustration on a simple example, then a model with a complexity high. In this spirit, languages, methods and tools development used to specify and development must reach a level of quality to meet the requirements expressed. Face this situation, we are helping in this work the systematic use of formal methods in systems development cycles in the equipping and adapting the UML (Unified Modeling Language) which is the most exploited in industrial projects.
Bakola Mongo Junior Jugis
Moanda Ndeko Jean Marie
No associations
LandOfFree
Synthese des Controleurs Optimaux pour les Systemes a Evenements Discrets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Synthese des Controleurs Optimaux pour les Systemes a Evenements Discrets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synthese des Controleurs Optimaux pour les Systemes a Evenements Discrets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-80774