Minimalilty of finite automata representation in hybrid systems control

Authors:
Koichi Kobayashi;Jun-Ichi Imura
Affiliations:
Tokyo Institute of Technology, Tokyo, Japan;Tokyo Institute of Technology, Tokyo, Japan
Venue:
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Year:
2007

Citing 2
Cited 2

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Control of systems integrating logic, dynamics, and constraints

Automatica (Journal of IFAC)

Brief paper: An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks

Automatica (Journal of IFAC)
Stabilization of Finite Automata with Application to Hybrid Systems Control

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses a new approach to representing a finite automaton as a combination of a linear state equation with a smaller set of free binary variables (i.e., input variables) and binary inequalities, in order to reduce the computational time for solving the model predictive control problem of a class of hybrid systems. In particular, this paper is devoted to proving that a system representation derived by our proposed method is minimal in the sense that the number of its binary input variables is minimal among system models over all linear equivalence transformations that preserve the binary property of free (input) variables.