Probabilistic models for reo connector circuits

Journal of Universal Computer Science

Volumn 11, Issue 10, 2005, Pages 1718-1748

  Baier, Christel ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Bisimulation; Composition; Coordination; Markov Decision Process; Probabilistic Constraint Automata; Reo

Indexed keywords

EID: 29144518344     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article

References (45)

1. P. Abdulla, G. Baier, S. Purushothaman Iyer, and B. Jonsson. Simulating perfect channels with probabilistic lossy channels. Inf. and Comp., 197(1-2):22-40, 2005.
2. P. Abdulla, N. Bertrand, A. Rabinovich, and P. Schnoebelen. Verification of probabilistic systems with faulty communication, submitted for publication.
3. P. A. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71-90, 1996.
4. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
5. F. Arbab. Abstract behavior types: A foundation model for components and their composition. In [21], pages 33-70, 2003.
6. F. Arbab. Reo: A channel-based coordination model for component composition. Mathematical Structures in Computer Science, 14(3): 1-38, 2004.
7. F. Arbab, C. Baier, F. de Boer, and J. Rutten. Models and temporal logics for timed component connectors. In Proc. SEFM'04, 2004.
8. F. Arbab, G. Baier, J.J.M.M. Rutten, and M. Sirjani. Modeling component connectors in Reo by constraint automata. Sc. of Comp. Progr., to appear, 2005.
9. F. Arbab and J.J.M.M. Rutten. A coinductive calculus of component connectors. In Recent Trends in Algebraic Development Techniques, Proc. 16th WADT, LNCS 2755, pages 35-56, 2003.
10. C. Baier. Probabilistic models for Reo connector circuits. Extended version, 2005. see http://web.informatik.uni-bonn.de/I/baier/publikationen.html.
11. C. Baier, F. Ciesinski, and M. Größer. ProbMela: a modeling language for communicating probabilistic systems. In Proc. MEMOCODE, pages 57-66, 2004.
12. C. Baier, F. Ciesinski, and M. Größer. ProbMela and Model Checking Markov decision processes. Sig. Performance Evaluation Review 32(4), pages 22-27, 2005.
13. C. Baier and B. Engelen. Establishing qualitative properties for probabilistic lossy channel systems: An algorithmic approach. In Proc. ARTS, LNCS 1601, pages 34-52, 1999.
14. N. Bertrand and Ph. Schnoebelen. Model checking lossy channels systems is probably decidable. In Proc. FOSSACS, LNCS 2620, pages 120-135, 2003.
15. N. Bertrand and Ph. Schnoebelen. Verifying nondeterministic channel systems with probabilistic message losses. In Proc. Automated Verification of Infinite-State Systems (AVIS 2004), Electronic Notes in Theor. Comp. Sci., 2004. To appear.
16. H. Bohnenkamp, H. Hermanns, J.-P. Katoen, and R. Klaren. The modest modeling tool and its implementation. Computer Performance Evaluation/TOOLS, pages 116-133, 2003.
17. G. Cécé, A. Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20-31, 1996.
18. CIM. http://www.almende.com/cim/.
19. D. Clarke, D. Costa, and F. Arbab. Modeling coordination in biological systems. In Proc. of the Int. Symposium on Leveraging Applications of Formal Methods (ISoLA 2004), 2004.
20. D. Daly, D. D. Deavours, J. M. Doyle, A. J. Stillman, and P. G. Webster. Möbius: an extensible tool for performance and dependability modeling. In Proc. FTCS, pages 15-16, 1999.
21. F.S. de Boer, M.M. Bonsangue, S. Graf, and W.-P. de Roever, editors. Formal Methods for Components and Objects, LNCS 2852. Springer, 2003.
22. N. Diakov and F. Arbab. Compositional construction of web services using Reo. In Proc. ICEIS, Porto, 2004.
23. E.-E. Doberkat. The converse of a stochastic relation. Journal of Logic and Algebraic Programming, 62(1):133-154, 2005.
24. A. Finkel. Decidability of the termination problem for completely specificied protocols. Distributed Computing, 7(3): 129-135, 1994.
25. W. Fokkink. Introduction to Process Algebra. Texts in Theoretical Computer Science, An EATCS Series. Springer-Verlag, 1999.
26. M. Z. Kwiatkowska, G. Norman, and D. Parker. PRISM 2.0: A tool for probabilistic model checking. In Proc. QEST, pages 322-323, 2004.
27. M. Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 282(1):101-150, 2002.
28. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
29. D. Lehmann and M. O. Rabin. On the advantage of free choice: A symmetric and fully distributed solution to the Dining Philosophers problem (extended abstract). In Proc. POPL, pages 133-138, 1981.
30. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
31. N. Lynch and M.R. Tuttle. An introduction to input/output automata. CWI Quarterly, 2(3):219-246, 1989.
32. P. Panangaden and F. van Breugel, editors. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. CRM Monograph Series. American Mathematical Society, 2004.
33. S. Purushothaman Iyer and M. Narasimha. Probabilistic lossy channel systems. In Proc. TAPSOFT LNCS 1214, pages 667-681, 1997.
34. M. L. Puterman. Markov Decision Processes - Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, 1994.
35. A. Rabinovich. Quantitative analysis of probabilistic lossy channel systems. In Proc. ICALP, LNCS 2719, pages 1008-1021, 2003.
36. M. Reiter and A. Rubin. Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security, 1(1):66-92, 1998.
37. J.J.M.M. Rutten. Component connectors. In [32], chapter 5, pages 73-87. American Mathematical Society, 2004.
38. Ph. Schnoebelen. The verification of probabilistic lossy channel systems. In Validation of Stochastic Systems - A Guide to Current Research, LNCS 2925, pages 445-465, 2004.
39. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
40. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
41. S. Thrun. Probabilistic algorithms in robotics. AI Magazine, 21(4):93-109, 2000.
42. R. van Glabbeek, S. Smolka, B. Steffen, and C. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proc. LICS, pages 130-141, 1990.
43. D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. In Proc. PCSFW, pages 34-43, 1998.
44. S.-H. Wu, S. Smolka, and E. Stark. Composition and behaviors of probabilistic I/O automata. Theoretical Computer Science, 176(1-2):1-38, 1997.
45. Z. Zlatev, N. Diakov, and S. Pokraev. Construction of negotiation protocols for E-Commerce applications. ACM SIGecom Exchanges, 5(2): 11-22, November 2004.