Sciweavers

415 search results - page 39 / 83
» Regular Processes and Timed Automata
Sort
View
INFOCOM
2002
IEEE
14 years 1 months ago
Scheduling Processing Resources in Programmable Routers
—To provide flexibility in deploying new protocols and services, general-purpose processing engines are being placed in the datapath of routers. Such network processors are typi...
Prashanth Pappu, Tilman Wolf
DBPL
2007
Springer
98views Database» more  DBPL 2007»
14 years 2 months ago
Towards Practical Typechecking for Macro Tree Transducers
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
Alain Frisch, Haruo Hosoya
GLOBECOM
2010
IEEE
13 years 6 months ago
Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching
Multi-string matching is a key technique for implementing network security applications like Network Intrusion Detection Systems (NIDS) and anti-virus scanners. Existing DFA-based ...
Yi Tang, Junchen Jiang, Xiaofei Wang, Bin Liu, Yan...
FORMATS
2010
Springer
13 years 6 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
RTSS
2008
IEEE
14 years 3 months ago
Schedulability and Compatibility of Real Time Asynchronous Objects
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
Mohammad Mahdi Jaghoori, Delphine Longuet, Frank S...