77 search results - page 5 / 16 » Polynomial Interrupt Timed Automata |
FM
2001
Springer
13 years 12 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
COLT
1995
Springer
13 years 11 months ago
1995
Springer
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
ETFA
2008
IEEE
14 years 1 months ago
2008
IEEE
The reactivity of Networked Automation Systems (NAS) has direct influence on safety and quality aspects. It can be determined by a response time analysis, which itself can be calc...
ACNS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...