7311 search results - page 149 / 1463 » Time in State Machines |
139
click to vote
SEUS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract. Code generation from models is the ultimate goal of model-based design. For real-time systems the generated code must be analyzable for the worstcase execution time (WCET...
178
click to vote
DALT
2005
Springer
15 years 10 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
136
click to vote
IGPL
2006
15 years 4 months ago
2006
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
152
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeate...
163
click to vote
MCU
2007
15 years 5 months ago
2007
We present small polynomial time universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (18, 2). These machines simulate our new variant of tag system, the...