Discrete-event dynamic systems: The strictly convex case

0.00 Avg rating—0 Votes

Article ID:	iaor19952335
Country:	Switzerland
Volume:	57
Issue:	1
Start Page Number:	45
End Page Number:	63
Publication Date:	Jun 1995
Journal:	Annals of Operations Research
Authors:	Butkovic P., Cuninghame-Green R.A.
Keywords:	modelling

Abstract:

Given the observed output gj of a discrete-event system, a classical problem is to find a matrix realisation gj=cA^jb with A of least possible dimension. When the sequence gj is convex and ultimately 1-periodic, a linear-time algorithm suffices to construct such a realisation over the algebra (R,max,¸+). When the transient is strictly convex, this realisation is minimal-dimensional.

Reviews

Required fields are marked *. Your email address will not be published.