Realization of a class of discrete event sequence over max-algebra
Liming Wang, Xinhe Xu, R. A. Cuninghame‐Green · 2005
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;/spl alpha/) by means of exploring the underlying graph-theoretic implication, and present some new results.