Efficient finite abstraction of mixed monotone systems

Efficient finite abstraction of mixed monotone systems
复制标题

混合单调系统的高效有限抽象

DOI:
--
复制
发表时间:
2015
期刊:
International Conference on Hybrid Systems: Computation and Control
影响因子:
--
通讯作者:
M. Arcak
M. Arcak
中科院分区:
--
文献类型:
--
作者:
S. Coogan;M. Arcak

文献摘要

被引文献

相似文献

我们提出了一个有效的计算程序的有限抽象的离散时间的混合单调系统,考虑一个矩形分区的状态空间。混合单调系统可分解为递增分量和递减分量,是单调系统的重要推广。我们紧密overapproximate的一步可达集从一个盒子的初始条件计算分解函数只有两个点,无论状态空间的尺寸。我们应用我们的研究结果来验证昆虫种群动力学模型的动力学行为,并合成一个交通网络的信号策略。
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.