Probabilistic simulations for probabilistic processes

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

Volumn 836 LNCS, Issue , 1994, Pages 481-496

  Segala, Roberto ^a   Lynch, Nancy ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPOSITIONALITY; CONCURRENT COMPUTATION; LABELED TRANSITION SYSTEMS; PROBABILISTIC COMPUTATION; PROBABILISTIC PROCESS; PROBABILISTIC SIMULATION; PROBABILISTIC SYSTEMS;

COMPUTATION THEORY;

EID: 84937444411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48654-1_35     Document Type: Conference Paper

References (21)

1. J. Aspnes and M.P. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 15(1):441-460, September 1990.
2. M. Ben-Or. Another advantage of free choice completely asynchronous agreement protocols. In Proceedings of the 2nd PODC, August 1983.
3. I. Christoff. Testing equivalences for probabilistic processes. Technical Report DoCS 90/22, Ph.D. Thesis, Department of Computer Science, Uppsala University, Sweden, 1990.
4. M. Fischer and L. Zuck. Reasoning about uncertainty in fault tolerant distributed systems. In Proceedings of the Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 331, pages 142-158, 1988.
5. R.J. van Glabbeek, S.A. Smolka, B. Steffen, and C.M.N. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proceedings 5 th LICS, pages 130-141. IEEE Computer Society Press, 1990.
6. R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics (extended abstract). In Information Processing 89, pages 613-618. North-Holland, 1989. Full version available as Report CS-R9120, CWI, Amsterdam, 1991.
7. H. Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Department of Computer Science, Uppsala University, 1991.
8. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
9. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985.
10. B. Jonsson. Simulations between specifications of distributed systems. In Proceedings CONCUR 91, LNCS 527, pages 346-360, 1991.
11. B. Jonsson and K. G. Larsen. Specification and refinement of probabilistic processes. In Proceedings of the 6th LICS, July 1991.
12. E. Kushilevitz and M. Rabin. Randomized mutual exclusion algorithms revisited. In Proceedings of the 11th PODC, pages 275-284, 1992.
13. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1992.
14. D. Lehmann and M. Rabin. On the advantage of free choice: a symmetric and fully distributed solution to the dining philosophers problem. In Proceedings of the 8th POPL pages 133-138, January 1981.
15. N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th PODC, pages 137-151, Vancouver, Canada, August 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387.
16. N.A. Lynch and F.W. Vaandrager. Forward and backward simulations for timing-based systems. In Proceedings of the REX Workshop “Real-Time: Theory in Practice”, LNCS 600, pages 397-446, 1991.
17. R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
18. A. Pnueli. The temporal semantics of concurrent programs. TCS, 13:45-60, 1982.
19. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1(1):53-72, 1986.
20. K. Seidel. Probabilistic communicating processes. Technical Report PRG-102, Ph.D. Thesis, Programming Research Group, Oxford University Computing Laboratory, 1992.
21. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of 26th FOCS, pages 327-338, Portland, OR, 1985.