Updatable timed automata

P Bouyer, C Dufourd, E Fleury, A Petit - Theoretical Computer Science, 2004 - Elsevier
timed automata, based on the possibility to update the clocks in a more elaborate way than
simply reset them to zero. We call these automata updatable timed automatatimed automata. …

Expressiveness of updatable timed automata

P Bouyer, C Dufourd, E Fleury, A Petit - International Symposium on …, 2000 - Springer
… classical” timed automaton with … updatable timed automaton using only deterministic updates
is strongly bisimilar to a classical timed automaton and that any updatable timed automaton

Forward analysis of updatable timed automata

P Bouyer - Formal Methods in System Design, 2004 - Springer
… decidable updatable timed automata, that is updatable timed automata that belong to some
decidable class Aut(C, U). We will associate with each decidable updatable timed automaton

Are timed automata updatable?

P Bouyer, C Dufourd, E Fleury, A Petit - … , CAV 2000, Chicago, IL, USA, July …, 2000 - Springer
… 4 Undecidable Classes of Updatable Timed Automata In this section we exhibit some
important classes of updatable timed automata which are undecidable. All the proofs are …

Reachability for updatable timed automata made faster and more effective

P Gastin, S Mukherjee, B Srivathsan - arXiv preprint arXiv:2009.13260, 2020 - arxiv.org
… have concentrated on this subclass of timed automata with only resets [5, 23, 27]. Recently,
we have presented a zone based algorithm for updatable timed automata [16]. Due to the …

Updatable timed automata with one updatable clock

G Li, Y Wen, S Yuen - Science China Information Sciences, 2017 - Springer
… subclasses of updatable timed automata. Furthermore, the decidable model is also useful
for soft real-time systems verification and modelling, since the singleton updatable clock can …

On reachability analysis of updatable timed automata with one updatable clock

Y Wen, G Li, S Yuen - Structured Object-Oriented Formal Language and …, 2016 - Springer
updatable clock (UTA1s) with diagonal-free time … of updatable timed automata. The model
can be effectively used into soft real-time system modelling and analysis, where the updatable

Decidable and undecidable problems in schedulability analysis using timed automata

P Krčál, W Yi - International Conference on Tools and Algorithms for …, 2004 - Springer
time tasks whose best and worst execution times, and deadlines are known. We use timed
automata … In [FMPY03] tasks can update data variables shared between them and the control …

A survey of timed automata for the development of real-time systems

MTB Waez, J Dingel, K Rudie - Computer Science Review, 2013 - Elsevier
… , decision problems, and variants of timed automata. The other objective of this … of timed
automata in practice. To achieve the second aim, this article presents a survey on timed automata

Timed automata with asynchronous processes: Schedulability and decidability

E Fersman, P Pettersson, W Yi - Tools and Algorithms for the Construction …, 2002 - Springer
… In this paper, we have identified a decidable class of updatable automata, which is precisely
what we need to solve scheduling problems without assuming that preemptions occur only …