Sciweavers

245 search results - page 20 / 49
» Using Finite State Automata for Sequence Mining
Sort
View
CSL
2010
Springer
13 years 9 months ago
Automata vs. Logics on Data Words
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
Michael Benedikt, Clemens Ley, Gabriele Puppis
FSTTCS
2010
Springer
13 years 5 months ago
Model checking time-constrained scenario-based specifications
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...
S. Akshay, Paul Gastin, Madhavan Mukund, K. Naraya...
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 7 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
WWW
2003
ACM
14 years 8 months ago
An Evolutionary Approach to Web Request Prediction
This paper proposes an evolutionary algorithm that evolves a population of finite state automata to exploit user navigational path behavior to predict, in real-time, future reques...
Dario Bonino, Fulvio Corno, Giovanni Squillero
PTS
2007
99views Hardware» more  PTS 2007»
13 years 9 months ago
Testing Input/Output Partial Order Automata
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
Stefan Haar, Claude Jard, Guy-Vincent Jourdan