Testing probabilistic automata

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

Volumn 1119, Issue , 1996, Pages 299-314

  Segala, Roberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; PROBABILISTIC LOGICS;

FAILURE DISTRIBUTIONS; FINITE TRACES; PROBABILISTIC AUTOMATA; PROBABILISTIC COMPUTATION; PROBABILISTIC FRAMEWORK; RELATIVE PROBABILITY; SECOND KINDS; STRONG CONVERGENCE;

PROBABILITY DISTRIBUTIONS;

EID: 84955602517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_62     Document Type: Conference Paper

References (14)

1. S. Aggarwal. Time optimal self-stabilizing spanning tree algorithms. Technical Report MIT/LCS/TR-632, MIT Laboratory for Computer Science, 1994. Master's thesis
2. S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560-599, 1984
3. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984
4. H. Hansson. Time and Probability in Formal Design of Distributed Systems, volume 1 of Real-Time Safety Critical Systems. Elsevier, 1994
5. M. Hennessy. Algebraic Theory of Processes. MIT Press, Cambridge, MA, 1988
6. C.A.R. Hoaxe. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985
7. B. Jonsson, C. Ha-Stuart, and W. Yi. Testing and refinement for nondeterministic and probabilistic processes. In Proceedings of the Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pages 418-430, 1994
8. B. Jonsson and W. Yi. Compositional testing preorders for probabilistic processes. In Proceedings 10 th Annual Symposium on Logic in Computer Science, San Diego, California. IEEE Computer Society Press, 1995
9. N.A. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proceedings of the 13 th Annual A CM Symposium on Principles of Distributed Computing, Los Angeles, CA, pages 314-323, 1994
10. G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer science Depaxtment, Aaxhus University, 1981
11. A. Pogosyants and R. Segala. Formal verification of timed properties of randomized distributed algorithms. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada pages 174-183, August 1995
12. R. Segala. A compositional trace-based semantics for probabilistic automata. In Proceedings of CONCUR 95, Philadelphia, PA, USA, LNCS 962, pages 234-248, 1995
13. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, 1995
14. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.