<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Amit Bhatia</style></author><author><style face="normal" font="default" size="100%">Emilio Frazzoli</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Resolution-complete safety falsification of continuous time systems</style></title><secondary-title><style face="normal" font="default" size="100%">Decision and Control, 2006 45th IEEE Conference on</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">incremental search algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">linear systems</style></keyword><keyword><style  face="normal" font="default" size="100%">reachability analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">resolution-complete safety analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">samping-based algorithms</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Dec.</style></date></pub-dates></dates><pages><style face="normal" font="default" size="100%">3297-3302</style></pages><abstract><style face="normal" font="default" size="100%">In this paper we consider a class of analysis problems for control systems, aimed at safety falsification, i.e., checking whether a controlled trajectory exists that violates a given safety property. We introduce a notion of resolution completeness for safety falsification, and present a resolution-complete algorithm applicable to continuous-time LTI systems. The algorithm is based on deterministic incremental search procedures, building feasible trajectories exploring the reachable set at increasing resolution levels. Given a target resolution, the algorithm terminates either with a trajectory that violates the safety specification, or proves that no input within a certain class exists that violates the specification.</style></abstract></record></records></xml>
