Compositionality for probabilistic automata

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

Volumn 2761, Issue , 2003, Pages 208-221

  Lynch, Nancy ^a   Segala, Roberto ^b   Vaandrager, Frits ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF VERONA   (Italy)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; PROBABILISTIC LOGICS;

COMPOSITIONALITY; PREORDERS; PROBABILISTIC AUTOMATA; SIMULATION PREORDER; TRACE DISTRIBUTIONS;

PROBABILITY DISTRIBUTIONS;

EID: 35248838225     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_14     Document Type: Article

References (14)

1. S. Aggarwal. Time optimal self-stabilizing spanning tree algorithms. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May 1994. Available as Technical Report MIT/LCS/TR-632.
2. K.G. Larsen B. Jonsson. Specification and refinement of probabilistic processes. In Proceedings 6th Annual Symposium on Logic in Computer Science, Amsterdam, pages 266-277. IEEE Press, 1991.
3. N.A. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proceedings of the 13th Annual ACM Symposium on the Principles of Distributed Computing, pages 314-323, Los Angeles, CA, August 1994.
4. N.A. Lynch, R. Segala, and F.W. Vaandrager. Compositionality for probabilistic automata. Technical Report MIT-LCS-TR-907, MIT, Laboratory for Computer Science, 2003.
5. N.A. Lynch and M.R. Tuttle. An introduction to input/output automata. CWI Quarterly, 2(3):219-246, September 1989.
6. N.A. Lynch and F.W. Vaandrager. Forward and backward simulations, I: Untimed systems. Information and Computation, 121(2):214-233, September 1995.
7. A. Pogosyants, R. Segala, and N.A. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing, 13(3):155-186, 2000.
8. 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.
9. 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.
10. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
11. M.I.A. Stoelinga. Alea jacta est: Verification of Probabilistic, Real-Time and Parametric Systems. PhD thesis, University of Nijmegen, April 2002.
12. M.I.A. Stoelinga. An introduction to probabilistic automata. Bulletin of the European Association for Theoretical Computer Science, 78:176-198, October 2002.
13. M.I.A. Stoelinga and F.W. Vaandrager. Root contention in IEEE 1394. In J.-P. Katoen, editor, Proceedings 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems, Bamberg, Germany, volume 1601 of Lecture Notes in Computer Science, pages 53-74. Springer-Verlag, 1999.
14. th ICALP, volume 2719 of Lecture Notes in Computer Science, pages 407-418. Springer-Verlag, 2003.