Abstract
In this paper, we present the problem of the implementability of timed automata. The theoretical semantics of timed automata can not be exactly implemented in practice, because computers are digital and more or less precise; the properties verified on a timed automaton are not necessarily preserved when implementing it. We deal with two approaches: the first one is based on the modeling of the execution platform and the second studies an enlarged semantics for timed automata that lakes the imprecision into account.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.