Sciweavers

531 search results - page 36 / 107
» Formal Methods for Networks on Chips
Sort
View
RTSS
1997
IEEE
15 years 1 months ago
Static priority scheduling for ATM networks
Static-priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constra...
Chengzhi Li, Riccardo Bettati, Wei Zhao
TACAS
1997
Springer
132views Algorithms» more  TACAS 1997»
15 years 1 months ago
Test Generation for Intelligent Networks Using Model Checking
We study the use of model checking techniques for the generation of test sequences. Given a formal model of the system to be tested, one can formulate test purposes. A model checke...
André Engels, Loe M. G. Feijs, Sjouke Mauw
BIB
2008
93views more  BIB 2008»
14 years 9 months ago
A structured approach for the engineering of biochemical network models, illustrated for signalling pathways
Quantitative models of biochemical networks (signal transduction cascades, metabolic pathways, gene regulatory circuits) are a central component of modern systems biology. Buildin...
Rainer Breitling, David Gilbert, Monika Heiner, Ri...
IS
2011
14 years 4 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 2 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt