Making Hybrid Systems Easier to Model, Simulate, and Visualize
| dc.contributor.advisor | Cartwright, Robert | en_US |
| dc.contributor.committeeMember | Taha, Walid | en_US |
| dc.creator | Zeng, Yingfu | en_US |
| dc.date.accessioned | 2019-05-16T19:05:24Z | en_US |
| dc.date.available | 2019-05-16T19:05:24Z | en_US |
| dc.date.created | 2019-05 | en_US |
| dc.date.issued | 2019-03-25 | en_US |
| dc.date.submitted | May 2019 | en_US |
| dc.date.updated | 2019-05-16T19:05:24Z | en_US |
| dc.description.abstract | Specifying the behavior desired of hybrid systems requires analytical modeling of physical phenomena. Similarly, testing them requires simulation of continuous systems. While numerous tools support later stages of developing simulation codes, there is still a large gap between analytical modeling and running simulation code, which significantly impedes the ability of scientists and engineers to develop novel hybrid systems. The support for partial derivative, in particular, is limited in present mainstream modeling and simulation languages as well as reachability analysis tools for hybrid systems. Either they do not provide such language construct, requiring the modeler to manually transform the model or its correctness is unclear. In this thesis, we demonstrate that compile-time transformations can improve hybrid system formalisms by supporting partial derivatives and equational constraints. These improvements allow the user to express, among other things, the Euler-Lagrangian equation, and to capture practically relevant constraints that arise naturally in mechanical systems. Achieving this level of expressivity requires using a binding time-analysis (BTA), program differentiation, symbolic Gaussian elimination, and abstract interpretation using interval analysis. We give an operational semantics for the specialization process along with a declarative and algorithmic specifications of the binding-time analysis. A type safety theorem is given to show the correctness of the semantics for specialization. The declarative specification of binding-time analysis is used to prove soundness with respect to the specialization process. We also provide an open-source implementation demonstrating our approach. | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.citation | Zeng, Yingfu. "Making Hybrid Systems Easier to Model, Simulate, and Visualize." (2019) Diss., Rice University. <a href="https://hdl.handle.net/1911/105397">https://hdl.handle.net/1911/105397</a>. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/105397 | en_US |
| dc.language.iso | eng | en_US |
| dc.rights | Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. | en_US |
| dc.subject | Modeling | en_US |
| dc.subject | Simulation | en_US |
| dc.subject | Compile-time Transformation | en_US |
| dc.subject | Hybrid Systems | en_US |
| dc.subject | Binding-time Analysis | en_US |
| dc.title | Making Hybrid Systems Easier to Model, Simulate, and Visualize | en_US |
| dc.type | Thesis | en_US |
| dc.type.material | Text | en_US |
| thesis.degree.department | Computer Science | en_US |
| thesis.degree.discipline | Engineering | en_US |
| thesis.degree.grantor | Rice University | en_US |
| thesis.degree.level | Doctoral | en_US |
| thesis.degree.name | Doctor of Philosophy | en_US |
Files
Original bundle
1 - 1 of 1