DocumentCode :
300675
Title :
Realization of a class of discrete event sequence over max-algebra
Author :
Wang, Liming ; Xu, Xinhe ; Cuninghame-Green, R.A.
Author_Institution :
Dept. of Autom. Control, Northeastern Univ., Shenyang, China
Volume :
5
fYear :
1995
fDate :
21-23 Jun 1995
Firstpage :
3146
Abstract :
Realization theory plays a substantial role in conventional system theory, and is playing an even more prominent role in DES (discrete event system) study by virtue of its potential applications in combinatorial optimisation, neural networks synthesis, and VLSI design. In this paper the authors give a reasonable and (hopefully) convenient classification of discrete event sequences, further explorations from the combinatorial aspect of the problem, investigate specifically into minimal-dimensional realization of an infinite ascending transition discrete event sequence with a simple pattern (1;α) by means of exploring the underlying graph-theoretic implication, and present some new results
Keywords :
discrete event systems; graph theory; matrix algebra; realisation theory; sequences; VLSI design; combinatorial optimisation; discrete event sequence; graph-theoretic implication; infinite ascending transition discrete event sequence; max-algebra; minimal-dimensional realization; neural networks synthesis; realization theory; Algebra; Control system synthesis; Design optimization; Discrete event systems; Linear systems; Mathematics; Network synthesis; Neural networks; Timing; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
American Control Conference, Proceedings of the 1995
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-2445-5
Type :
conf
DOI :
10.1109/ACC.1995.532096
Filename :
532096
Link To Document :
بازگشت