Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2003: Automata, Languages and Programming pp 464–477Cite as

A Testing Scenario for Probabilistic Automata

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2719))

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].

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  3. R. Cleaveland, Z. Dayar, S. A. Smolka, and S. Yuen. Testing preorders for probabilistic processes. Information and Computation, 154(2):93–148, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  5. D.L. Cohn. Measure Theory. Birkhäuser, Boston, 1980.

    MATH  Google Scholar 

  6. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  9. B. Jonsson and W. Yi. Compositional testing preorders for probabilistic processes. Theoretical Computer Science, 2001.

    Google Scholar 

  10. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1–28, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  11. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.

    MATH  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  14. R. Segala. Testing probabilistic automata. In Proc. CONCUR’96, volume 1119 of Lecture Notes in Computer Science, pages 299–314, 1996.

    Google Scholar 

  15. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250–273, 1995.

    MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  17. M.I.A. Stoelinga. An introduction to probabilistic automata. In G. Rozenberg, editor, EATCS bulletin, volume 78, pages 176–198, 2002.

    Google Scholar 

  18. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Engineering, University of California, Santa Cruz

    Mariëlle Stoelinga

  2. Nijmegen Institute for Computing and Information Sciences, University of Nijmegen, The Netherlands

    Frits Vaandrager

Authors
  1. Mariëlle Stoelinga
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frits Vaandrager
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA, 30332-0205, USA

    Jan Karel Lenstra

  3. Department of Information Technology, Uppsala University, P.O. Box 337, 75105, Uppsala, Sweden

    Joachim Parrow

  4. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Gerhard J. Woeginger

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation