作者: Houssam Abbas , Georgios Fainekos
DOI: 10.1109/ALLERTON.2012.6483411
关键词:
摘要: The problem of falsifying temporal logic properties hybrid automata can be posed as a minimization by utilizing quantitative semantics for logics. Previous work has used variation Simulated Annealing (SA) to solve the problem. While SA is known converge global minimum continuous objective function over closed and bounded search space, or when space discrete, there do not exist convergence proofs cases addressed in that previous work. Namely, discontinuous, vector-valued function. In this paper, we derive conditions prove both scenarios. We also consider matters affecting practical performance SA.