A testing scenario for probabilistic automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 464-477

  Stoelinga, Mariëlle ^a   Vaandrager, Frits ^b  

^a University of California Santa Cruz   (United States)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; PROBABILISTIC LOGICS;

EXTERNAL OBSERVER; LARS-EN; PROBABILISTIC AUTOMATA; PROBABILISTIC BISIMULATIONS; TRACE DISTRIBUTIONS;

PROBABILITY DISTRIBUTIONS;

EID: 33645629463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_38     Document Type: Article

References (18)

1. 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.
2. 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.
3. R. Cleaveland, Z. Dayar, S. A. Smolka, and S. Yuen. Testing preorders for probabilistic processes. Information and Computation, 154(2):93-148, 1999.
4. 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.
5. D.L. Cohn. Measure Theory. Birkhäuser, Boston, 1980.
6. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.
7. 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.
8. 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.
9. B. Jonsson and W. Yi. Compositional testing preorders for probabilistic processes. Theoretical Computer Science, 2001.
10. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1-28, 1991.
11. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
12. 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.
13. 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.
14. R. Segala. Testing probabilistic automata. In Proc. CONCUR'96, volume 1119 of Lecture Notes in Computer Science, pages 299-314, 1996.
15. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
16. 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.
17. M.I.A. Stoelinga. An introduction to probabilistic automata. In G. Rozenberg, editor, EATCS bulletin, volume 78, pages 176-198, 2002.
18. M.I.A. Stoelinga and F.W. Vaandrager. A testing scenario for probabilistic automata. Technical Report NIII-R0307, Nymegen Institute for Computing and Information Sciences, University of Nijmegen, 2003. Available via http://www.soe.ucsc.edu/~marielle.