114 search results - page 8 / 23 » A Determinizable Class of Timed Automata |
124
Voted
HYBRID
2005
Springer
15 years 6 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...
88
Voted
FSTTCS
2006
Springer
15 years 4 months ago
2006
Springer
We consider a general class of timed automata parameterized by a set of "input-determined" operators, in a continuous time setting. We show that for any such set of opera...
110
Voted
QEST
2008
IEEE
15 years 6 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
101
click to vote
CAV
2001
Springer
15 years 5 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
109
Voted
LATA
2009
Springer
15 years 7 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...