A survey of timed automata for the development of real-time systems
Timed automata are a popular formalism to model real-time systems. They were introduced
two decades ago to support formal verification. Since then they have also been used for …
two decades ago to support formal verification. Since then they have also been used for …
Infinite runs in weighted timed automata with energy constraints
We study the problems of existence and construction of infinite schedules for finite weighted
automata and one-clock weighted timed automata, subject to boundary constraints on the …
automata and one-clock weighted timed automata, subject to boundary constraints on the …
Predictive runtime verification of timed properties
Runtime verification (RV) techniques are used to continuously check whether the (un-
trustworthy) output of a black-box system satisfies or violates a desired property. When we …
trustworthy) output of a black-box system satisfies or violates a desired property. When we …
Zone-based verification of timed automata: extrapolations, simulations and what next?
Timed automata have been introduced by Rajeev Alur and David Dill in the early 90's. In the
last decades, timed automata have become the de facto model for the verification of real …
last decades, timed automata have become the de facto model for the verification of real …
Remes: A resource model for embedded systems
C Seceleanu, A Vulgarakis… - 2009 14th IEEE …, 2009 - ieeexplore.ieee.org
In this paper, we introduce the model REMES for formal modeling and analysis of
embedded resources such as storage, energy, communication, and computation. The model …
embedded resources such as storage, energy, communication, and computation. The model …
Reachability-time games on timed automata
M Jurdziński, A Trivedi - International Colloquium on Automata …, 2007 - Springer
In a reachability-time game, players Min and Max choose moves so that the time to reach a
final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler …
final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler …
Symbolic optimal reachability in weighted timed automata
Weighted timed automata have been defined in the early 2000 s for modelling resource-
consumption or-allocation problems in real-time systems. Optimal reachability is decidable …
consumption or-allocation problems in real-time systems. Optimal reachability is decidable …
[HTML][HTML] Runtime enforcement of regular timed properties by suppressing and delaying events
Runtime enforcement is a verification/validation technique aiming at correcting possibly
incorrect executions of a system of interest. In this paper, we consider enforcement …
incorrect executions of a system of interest. In this paper, we consider enforcement …
Solving parity games on integer vectors
We consider parity games on infinite graphs where configurations are represented by
control-states and integer vectors. This framework subsumes two classic game problems …
control-states and integer vectors. This framework subsumes two classic game problems …
Model checking one-clock priced timed automata
We consider the model of priced (aka weighted) timed automata, an extension of timed
automata with cost information on both locations and transitions, and we study various …
automata with cost information on both locations and transitions, and we study various …