On Constructing a Shortest Linear Recurrence Relation

@inproceedings{KuijperOnCA,
  title={On Constructing a Shortest Linear Recurrence Relation},
  author={Margreet Kuijper and Jan C. Willems}
}
The second set of times above is identical to that of enabling times. Identification of the first set above is ensured by Conditions 2) and 4). Finally, Conditions 2) and 4) ensure that we can extract all interrupted times, which are the time epochs when the state transits from Se to S c e due to the occurrence of an event other than e: Necessity: We use contraposition. If Condition 1) is not satisfied, then we have an occurrence of e with an associated null transition observation. By Lemma 1… CONTINUE READING
11 Citations
5 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Recursive modeling of discrete - time time series , ” in Linear Algebra for Control Theory ,

  • P. Van Dooren, B. Wyman
  • Algebraic Coding Theory
  • 1994

On the design of observers for fault detection in communication networks

  • M. Schwartz
  • Discrete Event Systems : Modeling and Performance…
  • 1993

On recursiveness and related topics in linear systems

  • J. C. Willems
  • IEEE Trans . Automat . Contr .
  • 1986

Similar Papers

Loading similar papers…