| Author(s): |
Chaves, Daniel P. B.
;
Palazzo, Reginaldo, Jr.
;
Baralt, J
;
Callaos, N
;
Chu, HW
;
Lesso, W
;
Savoie, MJ
;
Siddique, M
;
Zinn, CD
Total Authors: 9
|
| Document type: | Journal article |
| Source: | IMCIC'11: THE 2ND INTERNATIONAL MULTI-CONFERENCE ON COMPLEXITY, INFORMATICS AND CYBERNETICS, VOL I; v. N/A, p. 6-pg., 2011-01-01. |
| Abstract | |
In this paper we represent the evolution of a control system through a symbolic model that is obtained by a bisimulation relation, and show the relation between consistent symbolic representation and bisimulation relation. We characterize the system behavior from both a local and a global perspective, that is, when getting the control sequences from a specific state of the system and considering the set of possible control sequences that can be generated from some of the states of the system, respectively. Our approach is based on the concepts of constraint and irreducible offenders sets presented here, and demonstrates how graph presentations of the admissible control sequences can be derived from these concepts. (AU) | |