1246 search results - page 45 / 250 » Recursive Timed Automata |
140
Voted
TACAS
2010
Springer
15 years 7 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
104
Voted
ATVA
2005
Springer
15 years 6 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...
106
click to vote
CONCUR
2006
Springer
15 years 2 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...
116
Voted
ICTAC
2005
Springer
15 years 6 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...
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...