Efficient finite abstraction of mixed monotone systems
Efficient finite abstraction of mixed monotone systems
复制标题
混合单调系统的高效有限抽象
DOI:
--
复制
发表时间:
2015
期刊:
影响因子:
--
通讯作者:
M. Arcak
中科院分区:
文献类型:
--
作者:
S. Coogan;M. Arcak
We present an efficient computational procedure for finite abstraction of discrete-time mixed monotone systems by considering a rectangular partition of the state space. Mixed monotone systems are decomposable into increasing and decreasing components, and significantly generalize the well known class of monotone systems. We tightly overapproximate the one-step reachable set from a box of initial conditions by computing a decomposition function at only two points, regardless of the dimension of the state space. We apply our results to verify the dynamical behavior of a model for insect population dynamics and to synthesize a signaling strategy for a traffic network.