904 search results - page 119 / 181 » The State Problem for Evolutionary Testing |
IANDC
2011
14 years 5 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
ISCIS
2009
Springer
15 years 4 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...
DAC
1996
ACM
15 years 2 months ago
1996
ACM
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
PSTV
1993
14 years 11 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
BMEI
2008
IEEE
15 years 4 months ago
2008
IEEE
Inferring transcriptional regulatory networks from geneexpression data remains a challenging problem, in part because of the noisy nature of the data and the lack of strong networ...