Approximated Reachability on Hybrid Automata: Falsification meets Certification
Work
Year: 2008
Type: article
Abstract: Undecidability of the reachability problem is ubiquitous in the context of hybrid automata. Being mostly based on either bounded reachability or on the notion of simulation preorder, current technique... more
Institution University of Kaiserslautern
Cites: 26
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: gold