921 search results - page 108 / 185 » On Interleaving in Timed Automata |
RTAS
2003
IEEE
15 years 5 months ago
2003
IEEE
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
113
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
107
click to vote
VTS
2007
IEEE
15 years 6 months ago
2007
IEEE
Conventional error correcting code (ECC) schemes used in memories and caches cannot correct double bit errors caused by a single event upset (SEU). As memory density increases, mu...
IEAAIE
2001
Springer
15 years 4 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
ACSD
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Semantics of many specification languages, particularly those used in the domain of hardware, is described in terms of vector-based transition systems. In such a transiti...