Asynchronous $l$-Complete Approximations
Systems and Control
2014-02-25 v1
Abstract
This paper extends the -complete approximation method developed for time invariant systems to a larger system class, ensuring that the resulting approximation can be realized by a finite state machine. To derive the new abstraction method, called asynchronous -complete approximation, an asynchronous version of the well-known concepts of state property, memory span and -completeness is introduced, extending the behavioral systems theory in a consistent way.
Cite
@article{arxiv.1402.5759,
title = {Asynchronous $l$-Complete Approximations},
author = {Anne-Kathrin Schmuck and Jörg Raisch},
journal= {arXiv preprint arXiv:1402.5759},
year = {2014}
}