Sciweavers

93 search results - page 13 / 19
» Timed Unfoldings for Networks of Timed Automata
Sort
View
ANCS
2007
ACM
15 years 3 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...
ICC
2011
IEEE
237views Communications» more  ICC 2011»
13 years 11 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
ICC
2007
IEEE
144views Communications» more  ICC 2007»
15 years 6 months ago
A Deterministic Cost-effective String Matching Algorithm for Network Intrusion Detection System
—Network Intrusion Detection Systems (NIDS) are more and more important in today’s network security for identifying and preventing malicious attacks over the network. This pape...
Nen-Fu Huang, Yen-Ming Chu, Chen-Ying Hsieh, Chi-H...
DATE
2010
IEEE
126views Hardware» more  DATE 2010»
15 years 3 months ago
Scenario-based analysis and synthesis of real-time systems using uppaal
Abstract. We propose an approach to scenario-based analysis and synthesis of real-time embedded systems. The inter-process behaviors of a system are modeled as a set of driving uni...
Kim Guldstrand Larsen, Shuhao Li, Brian Nielsen, S...
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 11 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel