FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
We define quantitative similarity functions between timed transition systems that measure the degree of closeness of two systems as a real, in contrast to the traditional boolean ...
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
Monitoring real-time concurrent systems is a challenging task. In this paper we formulate (model-based) supervision by means of hidden state history reconstruction, from event (e.g...
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer