Cyber-Physical Systems (CPS) are often deployed in critical applications subject to strict timing constraints. To guarantee their timing correctness, much of the effort has been dedicated to the development of validation and verification methods for CPS (e.g., timing and schedulability analysis). As CPS becomes increasingly complex, there is an urgent need for efficient optimization techniques that can handle large-scale systems. This has been challenging as timing and schedulability analysis are often too difficult and inefficient to use in optimization framework such as mathematical programming. Existing practice mostly relies on ad-hoc heuristics which suffer from sub-optimal solution quality and limited applicability. In this paper, we discuss new directions for developing optimization algorithms for time-critical CPS that address the above issues. We present a number of previous studies and show that the proposed approaches have the potential to significantly improve on scalability while guaranteeing solution quality. Still, there are large grounds to be covered, which calls for participation from the research community.
Optimization techniques for time-critical cyber-physical systems
Published 2019 in DESTION@CPSIoTWeek
ABSTRACT
PUBLICATION RECORD
- Publication year
2019
- Venue
DESTION@CPSIoTWeek
- Publication date
2019-04-15
- Fields of study
Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-76 of 76 references · Page 1 of 1
CITED BY
Showing 1-1 of 1 citing papers · Page 1 of 1