30 search results - page 1 / 6 » A Testing Scenario for Probabilistic Automata |
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
114
click to vote
ALT
2005
Springer
15 years 10 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
JACM
2007
15 years 1 months ago
2007
ENTCS
2007
15 years 1 months ago
2007
We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a si...
143
click to vote
CONCUR
1994
Springer
15 years 5 months ago
1994
Springer
We augment the I/O automaton model of Lynch and Tuttle with probability, as a step toward the ultimate goal of obtaining a useful tool for specifying and reasoning about asynchron...