Name
Abstract | ||
|---|---|---|
The design of cyber-physical systems (CPSs) requires methods and tools that can efficiently reason about the interaction between discrete models, e.g., representing the behaviors of “cyber” components, and continuous models of physical processes. Boolean methods such as satisfiability (SAT) solving are successful in tackling large combinatorial search problems for the design and verification of ha... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/JPROC.2018.2849003 | Proceedings of the IEEE |
Keywords | DocType | Volume |
Cyber-physical systems,Design automation,Optimization,Convex functions,Machine learning,Complexity theory | Journal | 106 |
Issue | ISSN | Citations |
9 | 0018-9219 | 1 |
PageRank | References | Authors |
0.40 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yasser Shoukry | 1 | 104 | 12.27 |
| Pierluigi Nuzzo | 2 | 305 | 33.35 |
| Alberto L. Sangiovanni-Vincentelli | 3 | 11385 | 1881.40 |
| Sanjit A. Seshia | 4 | 2226 | 168.09 |
| George Pappas | 5 | 6632 | 540.42 |
| Paulo Tabuada | 6 | 4281 | 264.80 |