Probability and nondeterminism in operational models of concurrency

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

Volumn 4137 LNCS, Issue , 2006, Pages 64-78

  Segala, Roberto ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBABILITY;

NONDETERMINISM; OPERATIONAL MODELS; PROBABILISTIC AUTOMATA;

CONCURRENCY CONTROL;

EID: 33749562781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817949_5     Document Type: Conference Paper

References (40)

1. R. Alur and T. Henzinger. Reactive modules. Formal Methods in System Design 15(1):7-48, 1999.
2. S. Andova, T. Willemse. Branching bisimulation for probabilistic systems: characteristics and decidability. Theoretical Computer Science, 356(3):325-355, 2006.
3. C. Baier, H. Hermanns, J-P.Katoen, and V. Wolf. Comparative branching-time semantics for rnarkov chains. In Proceedings of CONCUR 2003, LNCS 2761, 2003.
4. C. Baier and M. Stoelinga. Norm functions for bisimulations with delays. In Proceedings of FOSSACS, LNCS 1784, pages 407-418, 2000.
5. F. Bartels, A. Sokolova, and E. de Vink. A hierarchy of probabilistic system types. Theoretical Computer Science., 327(1-2):3-22, 2004.
6. M. Bernardo and R. Gorrieri. Extended markovian process algebra. In [29].
7. M. Bravetti and P.R. D'Argenio. Tutte le algebre insieme: concepts, discussions and relations of stochastic process algebras with general distributions. In Validation of Stochastic Systems, LNCS 2925, pages 44-88, 2004.
8. S. Cattani and R. Segala. Decision algorithms for probabilistic bisimulation. In Proceedings of CONCUR, LNCS 2421, pages 371-385, 2002.
9. S. Cattani, R. Segala, M. Kwiatkowska, and G. Norman. Stochastic transition systems for continuous state spaces and non-determinism. In Proceedings of FOSSACS, LNCS 3441, pages 125-139, 2005.
10. L. Cheung, N. Lynch, R. Segala, and F. Vaandrager. Switched probabilistic I/O automata. In Proceedings of ICTAC, LNCS 3407, pages 494-510, 2004.
11. V. Daniele and G. Winskel. Distributing probability over non-determinism. Mathematical Structures in Computer Science, 16:87-113, 2006.
12. P. D'Argenio, H. Hermanns, and J.P. Katoen. On generative parallel composition. In Proceedings of PROBMIV'98, ENTCS 22, 1999.
13. L. de Alfaro, T.A. Henzinger, and R. Jhala. Compositional methods for probabilistic systems. In Proceedings of CONCUR, LNCS 2154, 2001.
14. Y. Deng. Axiomatisations and types for probabilistic and mobile processes. PhD thesis, Ecole de Mines, 2005.
15. C. Derman. Finite State Markovian Decision Processes. Academic Press, 1970.
16. J. Desharnais. Labelled Markov Processes. PhD thesis, McGill University, 1999.
17. J. Desharnais, A. Edalat, and P. Panangaden. A logical characterization of bisimulation for labelled Markov processes. In Proceedings of LICS, 1998.
18. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. Information and Computation, 179(2):163-193, 2002.
19. R. van Glabbeek, S. Smolka, B. Steffen. Reactive, generative, and stratified models of probabilistic processes. Information and Computation, 121(1):59-80, 1996.
20. N. Götz, U. Herzog, and M. Rettelbach. Multiprocessor and distributed system design; the integration of functional specification and performance analysis using stochastic process algebras, In Performance Evaluation of Computer and Communication Systems. Joint Tutorial Papers of Performance '93 and Sigmetrics '93, LNCS 729, pages 121-146, 1993.
21. H. Hansson. Time and Probability in Formal Design of Distributed Systems, volume 1 of Real-Time Safety Critical Systems. Elsevier, 1994.
22. H. Hansson and B. Jonsson, A calculus for communicating systems with time and probabilities, In Proceedings of RTSS, 1990.
23. H. Hermanns. Interactive Markov Chains: The Quest for Quantified Quality, LNCS 2428, 2002.
24. J. Hillston. A Compositional Approach to Performance Modeling. PhD thesis, Department of Computer Science, University of Edimburgh (UK), 1994.
25. B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proceedings of LICS, pages 266-277, July 1991.
26. N.A. Lynch and E.W. Stark. A proof of the Kahn principle for Input/Output automata. Information and Computation, 82(1):81-92, 1989.
27. N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of PoDC, pages 137-151, 1987.
28. A. McIver and C. Morgan. Abstraction, refinement, and proof for probabilistic systems. Springer-Verlag, 2005.
29. U. Montanari and V. Sassone, editors. Proceedings of CONCUR, LNCS 1119, 1996.
30. P. Panangaden. Measure and probability for concurrency theorists. Theoretical Computer Science, 253(2):287-309, 2001.
31. A. Parma and R. Segala. Axiomatization of trace semantics for stochastic nondeterministic processes. In Proceedings of QEST, pages 294-303, 2004.
32. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. In Proceedings of CONCUR 2000, LNCS 1877, pages 334-349, 2000.
33. A. Pogosyants, R. Segala, and N. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distrib. Comp. 13:155-186, 2000.
34. M.O. Rabin. Probabilistic automata. Information and Control, 6:230-245, 1963.
35. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995.
36. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
37. R. Segala and A. Turrini. Comparative analysis of bisimulation relations on alternating and non-alternating probabilistic models. In Proceedings of QEST, 2005.
38. R. Tix, K. Keimel, and G. Plotkin. Semantic domains for combining probability and non-determinism. ENTCS 129:1-104, 2005.
39. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of FoCS, pages 327-338, 1985.
40. S.H. Wu, S. Smolka, and E.W. Stark. Composition and behaviors of probabilistic I/O automata. Theoretical Computer Science, 176(1-2): 1-38, 1999.