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.
Research supported by PROGRESS Project TES4199, Verification of Hard and Softly Timed Systems (HaaST). A preliminary version of this paper appeared in the PhD thesis of the first author [Sto02a].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. On the consistency of Koomenās fair abstraction rule. Theoretical Computer Science, 51(1/2):129ā176, 1987.
J.A. Bergstra and J.W. Klop. Verification of an alternating bit protocol by means of process algebra. In W. Bibel and K.P. Jantke, editors, Math. Methods of Spec. and Synthesis of Software Systemsā 85, Math. Research 31, pages 9ā23, Berlin, 1986. Akademie-Verlag.
R. Cleaveland, Z. Dayar, S. A. Smolka, and S. Yuen. Testing preorders for probabilistic processes. Information and Computation, 154(2):93ā148, 1999.
I. Christoff. Testing equivalence and fully abstract models of probabilistic processes. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
D.L. Cohn. Measure Theory. BirkhƤuser, Boston, 1980.
R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83ā133, 1984.
R.J. van Glabbeek. The linear time ā branching time spectrum I. The semantics of concrete, sequential processes. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra, pages 3ā99. North-Holland, 2001.
C. Gregorio-RodrĆgez and M. NĆŗƱez. Denotational semantics for probabilistic refusal testing. In M. Huth and M.Z. Kwiatkowska, editors, Proc. ProbMIVā98, volume 22 of Electronic Notes in Theoretical Computer Science, 1998.
B. Jonsson and W. Yi. Compositional testing preorders for probabilistic processes. Theoretical Computer Science, 2001.
K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1ā28, 1991.
R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
R. Segala. Compositional trace-based semantics for probabilistic automata. In Proc. CONCURā95, volume 962 of Lecture Notes in Computer Science, pages 234ā248, 1995.
R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1995. Available as Technical Report MIT/LCS/TR-676.
R. Segala. Testing probabilistic automata. In Proc. CONCURā96, volume 1119 of Lecture Notes in Computer Science, pages 299ā314, 1996.
R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250ā273, 1995.
M.I.A. Stoelinga. Alea jacta est: verification of probabilistic, real-time and parametric systems. PhD thesis, University of Nijmegen, the Netherlands, April 2002. Available via http://www.soe.ucsc.edu/~marielle.
M.I.A. Stoelinga. An introduction to probabilistic automata. In G. Rozenberg, editor, EATCS bulletin, volume 78, pages 176ā198, 2002.
M.I.A. Stoelinga and F.W. Vaandrager. A testing scenario for probabilistic automata. Technical Report NIII-R0307, Nijmegen Institute for Computing and Information Sciences, University of Nijmegen, 2003. Available via http://www.soe.ucsc.edu/~marielle.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stoelinga, M., Vaandrager, F. (2003). A Testing Scenario for Probabilistic Automata. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_38
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive