7311 search results - page 373 / 1463 » Time in State Machines |
193
click to vote
SAC
2010
ACM
16 years 28 days ago
2010
ACM
This paper describes the concept of software adaptation patterns and how they can be used in software adaptation of serviceoriented architectures. The patterns are described in te...
232
click to vote
MOMM
2009
ACM
16 years 8 days ago
2009
ACM
Modeling adaptivity is a challenging task for two reasons: 1) adaptation is usually strongly interwoven with the general functionality of the web application, separation of concer...
182
click to vote
STACS
1989
Springer
15 years 11 months ago
1989
Springer
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
199
click to vote
DATE
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, we present a technique to design and verify the Look-Aside (LA-1) Interface standard used in network processors. Our design flow includes several refinements starti...
221
click to vote
DCOSS
2006
Springer
15 years 11 months ago
2006
Springer
In the population protocol model introduced by Angluin et al. [2], a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise ...