1355 search results - page 15 / 271 » Alternating Timed Automata over Bounded Time |
RTSS
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
HYBRID
2005
Springer
14 years 1 months 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...
FOSSACS
2004
Springer
14 years 29 days ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
ENTCS
2006
13 years 7 months ago
2006
The application of formal methods to analog and mixed signal circuits requires efficient methods tructing abstractions of circuit behaviors. This paper concerns the verification o...
CONCUR
2004
Springer
14 years 29 days 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...