TY - GEN
T1 - Infinite probabilistic and nonprobabilistic testing
AU - Kumar, K. Narayan
AU - Cleaveland, Rance
AU - Smolka, Scott A.
PY - 1998
Y1 - 1998
N2 - We introduce three new notions of infinite testing for probabilistic processes, namely, simple, Büchi and fair infinite testing. We carefully examine their distinguishing power and show that all three have the same power as finite tests. We also consider Büchi tests in the non-probabilistic setting and show that they have the same distinguishing power as finite tests. Finally, we show that finite probabilistic tests are stronger than nondeterministic fair tests.
AB - We introduce three new notions of infinite testing for probabilistic processes, namely, simple, Büchi and fair infinite testing. We carefully examine their distinguishing power and show that all three have the same power as finite tests. We also consider Büchi tests in the non-probabilistic setting and show that they have the same distinguishing power as finite tests. Finally, we show that finite probabilistic tests are stronger than nondeterministic fair tests.
UR - https://www.scopus.com/pages/publications/84887065061
U2 - 10.1007/978-3-540-49382-2_19
DO - 10.1007/978-3-540-49382-2_19
M3 - Conference contribution
AN - SCOPUS:84887065061
SN - 3540653848
SN - 9783540653844
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 209
EP - 220
BT - Foundations of Software Technology and Theoretical Computer Science - 18th Conference, Proceedings
T2 - 18th Foundations of Software Technology and Theoretical Computer Science Conference, FST and TCS 1998
Y2 - 17 December 1998 through 19 December 1998
ER -