Year: 2019
Type: conference-paper
Abstract: Model checking of hybrid systems is usually expressed in terms of the following reachability problem for hybrid automata (HA) [6]: given an HA M, a set of initial states I, and a set of unsafe states U, determine whether there exists a trajectory of M starting in an initial state and ending in an unsafe state. The time-bounded version of this problem considers trajectories that are within a given time bound T.
Authors: Dung Phan, Nicola Paoletti, Timothy Zhang, Radu Grosu, Scott A. Smolka, Scott D. Stoller
Institutions: Stony Brook University, University of London, TU Wien
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Awards: G1523888516, G1786858232, CPS: Frontier: Collaborative Research: Compositional, Approximate, and Quantitative Reasoning for Medical Cyber-Physical Systems, From Clarity to Efficiency for Distributed Algorithms, Closed-Loop Formal Verification of ICDs Using Cardiac Electrophysiological Models, G538913274, G6098521345, BIGDATA: F: DKM: DKA: Big Data Modeling and Analysis with Depth and Scale, TWC: Small: Towards Trustworthy Access Control Policies, G8876996369, G887799618
OpenAlex ID: W2883762059