Sciweavers

3169 search results - page 63 / 634
» Robust Timed Automata
Sort
View
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
14 years 10 days ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
ESORICS
2009
Springer
14 years 3 months ago
Hide and Seek in Time - Robust Covert Timing Channels
Abstract. Covert timing channels aim at transmitting hidden messages by controlling the time between transmissions of consecutive payload packets in overt network communication. Pr...
Yali Liu, Dipak Ghosal, Frederik Armknecht, Ahmad-...
AUTOMATICA
2008
81views more  AUTOMATICA 2008»
13 years 8 months ago
Robust supervisory control of timed discrete event systems under partial observation based on eligible time bounds: The existenc
This paper addresses a supervisory control problem for uncertain timed discrete event systems (DESs) under partial observation. An uncertain timed DES to be controlled is represen...
Seong-Jin Park, Kwang-Hyun Cho
DLT
2007
13 years 10 months ago
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes determin...
Marcella Anselmo, Dora Giammarresi, Maria Madonia
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
14 years 22 days ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan