921 search results - page 43 / 185 » On Interleaving in Timed Automata |
119
click to vote
ATVA
2005
Springer
15 years 7 months ago
2005
Springer
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
118
click to vote
CONCUR
2006
Springer
15 years 4 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...
124
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...
141
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...