921 search results - page 68 / 185 » On Interleaving in Timed Automata |
ACL
1998
15 years 7 months ago
1998
The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to pure...
154
click to vote
COCO
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
190
click to vote
ACNS
2009
Springer
15 years 10 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...
182
click to vote
HYBRID
2000
Springer
15 years 10 months ago
2000
Springer
We propose a computer-aided methodology to automatically generate time optimal production schemes for chemical batch plants operating in multi-batch mode. Our approach is based on ...
162
click to vote
CAV
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we present the features of Romeo, a Time Petri Net (TPN) analyzer. The tool Romeo allows state space computation of TPN and on-the-fly model-checking of reachabilit...