52 search results - page 3 / 11 » Verifying Linear Duration Constraints of Timed Automata |
HYBRID
2005
Springer
14 years 29 days ago
2005
Springer
We study the class of lazy linear hybrid automata with finite precision. The key features of this class are: – The observation of the continuous state and the rate changes assoc...
HYBRID
2007
Springer
13 years 11 months ago
2007
Springer
A notion of diagnosability for hybrid systems is defined, which generalizes the notion of observability. We verify bility properties on a timed automaton abstraction of the origina...
ISCAS
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper, we present a new method for verifying the realizability of a timing diagram with linear timing constraints, thus ensuring that the implementation of the underlying ...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
In this paper we study one-clock priced timed automata in which prices can grow linearly ( ˙p = k) or exponentially ( ˙p = kp), with discontinuous updates on edges. We propose E...
RTSS
1998
IEEE
13 years 11 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...