Sciweavers

1916 search results - page 252 / 384
» Reconfiguring a state machine
Sort
View
APLAS
2010
ACM
13 years 6 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
13 years 6 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
MEMOCODE
2010
IEEE
13 years 6 months ago
A regular expression matching using non-deterministic finite automaton
Abstract--This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the pa...
Hiroshi Nakahara, Tsutomu Sasao, Munehiro Matsuura
SIGSOFT
2010
ACM
13 years 6 months ago
Realizability analysis for message-based interactions using shared-state projections
The global interaction behavior in message-based systems can be specified as a finite-state machine defining acceptable sequences of messages exchanged by a group of peers. Realiz...
Sylvain Hallé, Tevfik Bultan
VTC
2010
IEEE
132views Communications» more  VTC 2010»
13 years 6 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