Sciweavers

3169 search results - page 126 / 634
» Robust Timed Automata
Sort
View
CONCUR
2006
Springer
14 years 17 hour ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
IMECS
2007
13 years 11 months ago
Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt
— ACPsrt hs is a hybrid process algebra obtained by extending a combination of two existing extensions of Algebra of Communicating Processes (ACP), namely the process algebra wit...
Ka L. Man, Michel P. Schellekens
GLOBECOM
2010
IEEE
13 years 8 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...
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
14 years 1 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
NETWORKING
2010
13 years 11 months ago
A Longitudinal Study of Small-Time Scaling Behavior of Internet Traffic
We carry out a longitudinal study of evolution of small-time scaling behavior of Internet traffic on the MAWI dataset spanning 8 years. MAWI dataset contains a number of anomalies ...
Himanshu Gupta, Vinay J. Ribeiro, Anirban Mahanti