2632 search results - page 50 / 527 » Alternating Timed Automata |
113
click to vote
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
119
click to vote
ICTAC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
FSTTCS
2006
Springer
15 years 5 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...
138
click to vote
EMSOFT
2009
Springer
15 years 8 months ago
2009
Springer
This paper advocates a strict compositional and hybrid approach for obtaining key (performance) metrics of embedded At its core the developed methodology abstracts system componen...
ENTCS
2008
15 years 1 months ago
2008
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each valu...