415 search results - page 7 / 83 » Regular Processes and Timed Automata |
ANCS
2009
ACM
13 years 7 months ago
2009
ACM
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
JALC
2007
13 years 9 months ago
2007
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
FOSSACS
2004
Springer
14 years 3 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
ANCS
2009
ACM
13 years 7 months ago
2009
ACM
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
ACTA
2010
13 years 9 months ago
2010
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...