1753 search results - page 123 / 351 » State Machines |
128
click to vote
ISCIS
2009
Springer
15 years 11 months ago
2009
Springer
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
151
click to vote
SEFM
2005
IEEE
15 years 10 months ago
2005
IEEE
The development of test cases is an important issue for testing software, communication protocols and other reactive systems. A number of methods are known for the development of ...
141
click to vote
SAC
2010
ACM
15 years 9 months 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...
145
click to vote
MOMM
2009
ACM
15 years 9 months 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...
123
click to vote
STACS
1989
Springer
15 years 8 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 ...