Abstract
Timed automata follow a mathematical semantics, which assumes perfect precision and synchrony of clocks. Since this hypothesis does not hold in digital systems, properties proven formally on a timed automaton may be lost at implementation. In order to ensure implementability, several approaches have been considered, corresponding to different hypotheses on the implementation platform. We address two of these: A timed automaton is samplable if its semantics is preserved under a discretization of time; it is robust if its semantics is preserved when all timing constraints are relaxed by some small positive parameter. We propose a construction which makes timed automata implementable in the above sense: From any timed automaton A, we build a timed automaton A′ that exhibits the same behaviour as A, and moreover A′ is both robust and samplable by construction.
Original language | English |
---|---|
Book series | Lecture Notes in Computer Science |
Volume | 6901 LNCS |
Pages (from-to) | 76-91 |
Number of pages | 16 |
ISSN | 0302-9743 |
DOIs | |
Publication status | Published - 1 Jan 2011 |
Event | 22nd International Conference on Concurrency Theory - Aachen, Germany Duration: 6 Sept 2011 → 9 Sept 2011 Conference number: 22 |
Conference
Conference | 22nd International Conference on Concurrency Theory |
---|---|
Number | 22 |
Country/Territory | Germany |
City | Aachen |
Period | 06/09/2011 → 09/09/2011 |