114 search results - page 12 / 23 » A Determinizable Class of Timed Automata |
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
CONCUR
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
FMSB
2008
13 years 9 months ago
2008
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...