Jul 12, 2019 · The overall goal is to synthesize a linear hybrid automaton from a set of pwl functions such that the automaton captures the behavior described ...
The core of the algorithm is a membership query that checks whether, within the specified tolerance, a given data set can result from the execution of a given ...
(PDF) Membership-Based Synthesis of Linear Hybrid Automata
www.researchgate.net › publication › 33...
The core of the algorithm is a membership query that checks whether, within the specified tolerance, a given data set can result from the execution of a given ...
→ We consider non deterministic linear hybrid automata. → The LHA features piecewise-linear executions. Summary. 4 / 16. Page 7. Introductio 1. Preliminaries.
Abstract. We present an automatic approach for synthesizing a linear hybrid automaton from experimental data. Unlike previous approaches,.
Abstract. We present two algorithmic approaches for synthesiz- ing linear hybrid automata from experimental data. Unlike previous.
Two algorithmic approaches for synthesizing linear hybrid automata from experimental data are presented that construct a succinct model from the data and ...
The core of the algorithm is a membership query that checks whether, within the specified tolerance, a given data set can result from the execution of a given ...
Original language, English. Title of host publication, CAV. Number of pages, 18. Publisher, Springer. Publication date, 2019. Pages, 297-314.
The core of the algorithm is a membership query that checks whether, within the specified tolerance, a given data set can result from the execution of a given ...