Symbolic models for control systems

被引：0
作者：
Paulo Tabuada
机构：
[1] University of California at Los Angeles,Electrical Engineering Department
来源：
Acta Informatica | 2007年 / 43卷
关键词：
Control System; Equivalence Relation; Hybrid System; Symbolic Model; Hybrid Automaton;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we provide a bridge between the infinite state models used in control theory to describe the evolution of continuous physical processes and the finite state models used in computer science to describe software. We identify classes of control systems for which it is possible to construct equivalent (bisimilar) finite state models. These constructions are based on finite, but otherwise arbitrary, partitions of the set of inputs or outputs of a control system.
引用
收藏
页码：477 / 500
页数：23
相关论文
共 46 条
  • [1] Alur R.(1995)Hybrid automata: an algorithmic approach to specification and verification of hybrid systems Theor. Comput. Sci. 138 3-34
  • [2] Courcoubetis C.(1994)A theory of timed automata Theor. Comput. Sci. 126 183-235
  • [3] Halbwachs N.(1974)Machines in a category: an expository introduction SIAM Rev. 16 163-192
  • [4] Henzinger T.A.(1998)Hierarchical hybrid control systems: a lattice theoretic formulation IEEE Trans. Automat. Control Special Issue on Hybrid Systems 43 501-508
  • [5] Ho P.H.(1989–1990)An implementation of an efficient algorithm for bisimulation equivalence Sci. Comput. Program. 13 219-236
  • [6] Nicollin X.(1973)Realization is universal Math. Syst. Theory 6 359-374
  • [7] Olivero A.(1998)What’s decidable about hybrid automata? J Comput. Syst. Sci. 57 94-124
  • [8] Sifakis J.(2005)Bisimulation relations for dynamical, control and hybrid systems Theor. Comput. Sci. 34 387-392
  • [9] Yovine S.(2003)Safety and reachability of piecewise linear hybrid dynamical systems based on discrete abstractions J. Discret. Event Dyn. Syst. Theory Appl. 13 203-243
  • [10] Alur R.(2000)O-minimal hybrid systems Math. Control, Signals Syst. 13 1-21
12345