Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Modular feedback logic for discrete event systems
SIAM Journal on Control and Optimization
On observability of discrete-event systems
Information Sciences: an International Journal - Robotics and Automation/Control Series
Formulas for calculating supremal controllable and normal sublanguages
Systems & Control Letters
Verification of Real-Time Systems using Linear Relation Analysis
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Synthesis of Discrete-Event Controllers Based on the SignalEnvironment
Discrete Event Dynamic Systems
On the Synthesis of an Asynchronous Reactive Module
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Open Systems in Reactive Environments: Control and Synthesis
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Formal Methods in System Design
WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Solvability of Centralized Supervisory Control Under Partial Observation
Discrete Event Dynamic Systems
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
Apron: A Library of Numerical Abstract Domains for Static Analysis
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Effective Control Synthesis for Partially Observed Discrete-Event Systems
SIAM Journal on Control and Optimization
Proceedings of the 9th international conference on Hybrid Systems: computation and control
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
A lattice theory for solving games of imperfect information
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Symbolic test selection based on approximate analysis
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
We propose algorithms for the synthesis of state-feedback controllers with partial observation of infinite state discrete event systems modelled by Symbolic Transition Systems. We provide models of safe memoryless controllers both for potentially deadlocking and deadlock free controlled systems. The termination of the algorithms solving these problems is ensured using abstract interpretation techniques which provide an overapproximation of the transitions to disable. We then extend our algorithms to controllers with memory and to online controllers. We also propose improvements in the synthesis of controllers in the finite case which, to our knowledge, provide more permissive solutions than what was previously proposed in the literature. Our tool SMACS gives an empirical validation of our methods by showing their feasibility, usability and efficiency.