Asynchronous l-complete approximations

From MaRDI portal
Publication:464604

DOI10.1016/J.SYSCONLE.2014.08.005zbMATH Open1297.93044arXiv1402.5759OpenAlexW2044485540MaRDI QIDQ464604FDOQ464604

Anne-Kathrin Schmuck, Jörg Raisch

Publication date: 27 October 2014

Published in: Systems \& Control Letters (Search for Journal in Brave)

Abstract: This paper extends the l-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 l-complete approximation, an asynchronous version of the well-known concepts of state property, memory span and l-completeness is introduced, extending the behavioral systems theory in a consistent way.


Full work available at URL: https://arxiv.org/abs/1402.5759





Cites Work


Cited In (5)






This page was built for publication: Asynchronous \(l\)-complete approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464604)