Sciweavers

732 search results - page 63 / 147
» Axiomatising timed automata
Sort
View
RTSS
2007
IEEE
14 years 3 months ago
Composing Functional and State-Based Performance Models for Analyzing Heterogeneous Real-Time Systems
— We present a performance analysis technique for distributed real-time systems in a setting where certain components are modeled in a purely functional manner, while the remainin...
Linh T. X. Phan, Samarjit Chakraborty, P. S. Thiag...
IWPT
2001
13 years 10 months ago
Bidirectional Automata for Tree Adjoining Grammars
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
Miguel A. Alonso, Víctor J. Díaz, Ma...
ACL
1998
13 years 10 months ago
A Tabular Interpretation of a Class of 2-Stack Automata
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...
Eric Villemonte de la Clergerie, Miguel A. Alonso
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