The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Mode Switching Synthesis for Reachability Specifications
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Combinatorial sketching for finite programs
Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Verifying average dwell time of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Synthesizing Switching Logic Using Constraint Solving
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Systematic simulation using sensitivity analysis
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
On systematic simulation of open continuous systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Dimensions in program synthesis
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Synthesis of loop-free programs
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Synthesis of optimal switching logic for hybrid systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Optimal scheduling for constant-rate multi-mode systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Sciduction: combining induction, deduction, and structure for verification and synthesis
Proceedings of the 49th Annual Design Automation Conference
Synthesis of insulin pump controllers from safety specifications using Bayesian model validation
International Journal of Bioinformatics Research and Applications
Synthesizing switching controllers for hybrid systems by generating invariants
Theories of Programming and Formal Methods
Hi-index | 0.00 |
Cyber-physical systems (CPS) can be usefully modeled as hybrid automata combining the physical dynamics within modes with discrete switching behavior between modes. CPS designs must satisfy safety and performance requirements. While the dynamics within each mode is usually defined by the physical plant, the tricky design problem often involves getting the switching logic right. In this paper, we present a new approach to assist designers by synthesizing the switching logic, given a partial system model, using a combination of fixpoint computation, numerical simulation, and machine learning. Our technique begins with an over-approximation of the guards on transitions between modes. In successive iterations, the over-approximations are refined by eliminating points that will cause the system to reach unsafe states, and such refinement is performed using numerical simulation and machine learning. In addition to safety requirements, we synthesize models to satisfy dwell-time constraints, which impose upper and/or lower bounds on the amount of time spent within a mode. We demonstrate using case studies that our technique quickly generates intuitive system models and that dwell-time constraints can help to tune the performance of a design.