3229 search results - page 110 / 646 » The Theory of Timed Automata |
152
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
146
click to vote
CIT
2006
Springer
15 years 10 months ago
2006
Springer
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...
196
click to vote
FROCOS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
176
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
170
click to vote
HYBRID
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...