14 search results - page 2 / 3 » FIFO anomaly is unbounded |
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We study the stability of the commonly used packet forwarding protocol, FIFO (First In First Out), in the adversarial queueing model. We prove that FIFO can become unstable, i.e.,...
CAV
2004
Springer
13 years 9 months ago
2004
Springer
Predicate abstraction has been proved effective for verifying several infinite-state systems. In predicate abstraction, an abstract system is automatinstructed given a set of predi...
ICFEM
2004
Springer
13 years 10 months ago
2004
Springer
We present a novel approach for verifying safety properties of finite state machines communicating over unbounded FIFO channels that is based on applying machine learning techniqu...
CODES
2009
IEEE
14 years 7 days ago
2009
IEEE
Kahn Process Networks is an appealing model of computation for programming and mapping applications onto multi-processor platforms. Autonomous processes communicate through unboun...
CONCUR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...