Complete open-state testing of limitedly nondeterministic systems

DOI10.1134/S0361768809060012zbMath1183.68096OpenAlexW2016899833WikidataQ114979871 ScholiaQ114979871MaRDI QIDQ2654997

A. S. Kossatchev, I. B. Bourdonov

Publication date: 22 January 2010

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768809060012

zbMATH Keywords

complete testingtest algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Interaction semantics with refusals, divergence, and destruction

Uses Software

• UniTESK

Cites Work

• Unnamed Item
• Formalization of test experiments
• Traversal of an unknown directed graph by a finite robot
• Play to Test
• Matching, Euler tours and the Chinese postman
• Testing finite-state machines: state identification and verification

This page was built for publication: Complete open-state testing of limitedly nondeterministic systems