A testing scenario for probabilistic automata

30Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently, a large number of equivalences for probabilistic automata has been proposed in the literature. Except for the probabilistic bisimulation of Larsen & Skou, none of these equivalences has been characterized in terms of an intuitive testing scenario. In our view, this is an undesirable situation: in the end, the behavior of an automaton is what an external observer perceives. In this paper, we propose a simple and intuitive testing scenario for probabilistic automata and we prove that the equivalence induced by this scenario coincides with the trace distribution equivalence proposed by Segala. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Stoelinga, M., & Vaandrager, F. (2003). A testing scenario for probabilistic automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2719, 464–477. https://doi.org/10.1007/3-540-45061-0_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free