Sciweavers

942 search results - page 75 / 189
» Interrupt Timed Automata
Sort
View
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
14 years 15 days ago
On the Complexity of Intersecting Finite State Automata
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...
George Karakostas, Richard J. Lipton, Anastasios V...
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
14 years 27 days ago
Fast Packet Classification Using Condition Factorization
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...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
HYBRID
2000
Springer
14 years 15 days ago
Computing Optimal Operation Schemes for Chemical Plants in Multi-batch Mode
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 ...
Peter Niebert, Sergio Yovine
CAV
2005
Springer
144views Hardware» more  CAV 2005»
14 years 2 months ago
Romeo: A Tool for Analyzing Time Petri Nets
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...
Guillaume Gardey, Didier Lime, Morgan Magnin, Oliv...
CMSB
2007
Springer
14 years 3 months ago
Context Sensitivity in Logical Modeling with Time Delays
For modeling and analyzing regulatory networks based on qualitative information and possibly additional temporal constraints, approaches using hybrid automata can be very helpful. ...
Heike Siebert, Alexander Bockmayr