Sciweavers

2467 search results - page 91 / 494
» Finite State Machines
Sort
View
APLAS
2010
ACM
15 years 3 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander
CODES
2010
IEEE
15 years 3 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk
VTC
2010
IEEE
132views Communications» more  VTC 2010»
15 years 3 months ago
Throughput Analysis of General Network Coding Nodes Based on SW-ARQ Transmission
The steady-state throughput of general network coding node is investigated, when data is transmitted in packets based on the stopand-wait automatic repeat request (SW-ARQ) error-co...
Yang Qin, Lie-Liang Yang
EMSOFT
2006
Springer
15 years 9 months ago
Analysis of the zeroconf protocol using UPPAAL
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
Biniam Gebremichael, Frits W. Vaandrager, Miaomiao...
ASM
2005
ASM
15 years 11 months ago
Time in State Machines
State machines are considered a very general means of expressing computations in an implementation-independent way. There are also ways to extend the general state machine framewor...
Susanne Graf, Andreas Prinz