Matrix analysis
A protocol test generation procedure
Computer Networks and ISDN Systems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Failure-equivalent transformation of transition systems to avoid internal actions
Information Processing Letters
A fault-detection approach to the conformance testing of nondeterministic systems
Journal of Parallel and Distributed Computing
Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Effect of test set minimization on fault detection effectiveness
Software—Practice & Experience
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
IEEE Transactions on Software Engineering
Generating Test Sequences and their Degrees of Indeterminism for Protocols
Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Testing Non-Deterministic State Machines with Fault Coverage
Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
Test Derivation from Non-Deterministic Finite State Machines
Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems V
Generation of Adaptive Test Cases from Nondeterministic Finite State Models
Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems V
Test Set Size Minimization and Fault Detection Effectiveness: A Case Study in a Space Application
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
An Empirical Study of the Effects of Minimization on the Fault Detection Capabilities of Test Suites
ICSM '98 Proceedings of the International Conference on Software Maintenance
Optimal strategies for testing nondeterministic systems
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
On the synthesis of adaptive tests for nondeterministic finite state machines
Programming and Computing Software
Mutation testing from probabilistic and stochastic finite state machines
Journal of Systems and Software
Extracting test sequences from a Markov software usage model by ACO
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Automatic testing from formal specifications
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Adaptive testing of deterministic implementations specified by nondeterministic FSMs
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Conformance tests as checking experiments for partial nondeterministic FSM
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
The complexity of asynchronous model based testing
Theoretical Computer Science
Testing nondeterministic finite state machines with respect to the separability relation
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
| Hi-index | 0.00 |
The fault-state detection approach for blackbox testing consists of two phases. The first is to bring the system under test (SUT) from its initial state to a targeted state t and the second is to check various specified properties of the SUT at t. This paper investigates the first phase for testing systems specified as observable nondeterministic finite-state machines with probabilistic and weighted transitions. This phase involves two steps. The first step transfers the SUT to some state t' and the second step identifies whether t' is indeed the targeted state t or not. State transfer is achieved by moving the SUT along one of the paths of a transfer tree (TT) and state identification is realized by using diagnosis trees (DT). A theoretical foundation for the existence and characterization of TT and DT with minimum weighted height or minimum average weight is presented. Algorithms for their computation are proposed.