PROBMELA: A modeling language for communicating probabilistic processes

Proceedings - 2nd ACM and IEEE International Conference on Formal Methods and Models for Co-Design, MEMOCODE'04

Volumn , Issue , 2004, Pages 57-66

  Baier, Christel ^a   Ciesinski, Frank ^a   Größer, Marcus ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; MARKOV PROCESSES; PROBABILISTIC LOGICS; SEMANTICS;

MARKOV DECISION PROCESSES; PROBABILISTIC OPERATIONAL MODELS; VERIFICATION ALGORITHMS;

COMPUTER SIMULATION LANGUAGES;

EID: 28344445515     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (39)

1. P. Abdulla, C. Baier. P. Iyer, B. Jonsson. Reasoning about probabilistic lossy channel systems. In Proc. CONCUR'00, LNCS 1877:320-330, 2000.
2. S. Abramsky, A. Jung. Domain theory. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science Volume 3, pages 1-168. Oxford University Press, 1994.
3. R. Alur, T. Henzinger. Reactive modules. Formal Methods in System Design: An International Journal, 15(1):7-48, 1999.
4. K. Apt, E.-Olderog. Verification of sequential and concurrent programs. Springer Verlag, 1991.
5. C. Baier, M. Größer, F. Ciesinski. Partial order reduction for probabilistic systems. Submitted for publication, 2004.
6. A. Bianco, L. de Alfaro. Model checking of probabilistic and nondeterministic systems. LNCS, 1026:499-513, 1995.
7. H. Bohnenkamp, H. Hermanns, M. Zhang, F. Vaandrager. Cost-Optimization of the IPv4 Zeroconf Protocol. Proc. of the 3rd Progress Workshop on embedded systems, 2002.
8. S. Cheshire, B. Adoba. Dynamic configuration of IPv4 link-local addresses. Internet-draft, 2001. http://www.ietf.org/internet-drafts/draft-ietf- zeroconf-ipv4-linklocal-04.txt
9. C. Courcoubetis, M. Yannakakis. The complexity of probabilistic verification. J. of the MCM, 42(4):857-907, 1995.
10. P. d'Argenio, H. Hermanns, J. Katoen, R. Klaren. Modest - a modelling and description language for stochastic timed systems. Proc. PAPM/PKOBMIV, LNCS 2165:87-104, 2001.
11. P. d'Argenio, N. Wolovick. Verification of probabilistic and nondeterministic systems, 2004. forthcoming paper.
12. J. den Hartog. Probabilistic Extensios of Semantical Models. PhD thesis, Universiteit Amsterdam, 2002.
13. J. den Hartog, E. de Vink. Verifying probabilistic programs using a hoare like logic. In Asian Computing Science Conference, pages 113-125, 1999.
14. E. Dijkstra. Guarded commands, non-determinacy and the formal derivation of programs. Comm. ACM, 18:453-457, 1975.
15. A. Giacalone, C. Jou, S. Smolka. Algebraic reasoning for probabilistic concurrent systems. Proc. IFIP TC2 Working Conf. on Programming Concepts and Methods, 1990.
16. H. Hansson. Time and Probability in Formal Design of Distributed Systems. Series in Real-Time Safety Critical Systems. Elsevier, 1994.
17. H. Hansson, B. Jonsson. A calculus for communicating systems with time and probabitilies. In I. C. S. Press, editor, Proc. of the Real-Time Systems Symposium - 1990, pages 278-287, 1990. IEEE Computer Society Press.
18. H. Hansson, B. Jonsson. A logic for reasoning about time and reliability. Formal Asp. of Comp., 6(5):512-535, 1994.
19. V. Hartonas-Garmhausen, S. Campos, E. Clarke. ProbVerus: Probabilistic symbolic model checking. Proc. ARTS'99 LNCS, 1601:96-110, 1999.
20. J. He, K. Seidel. A. McIver. Probabilistic models for the guarded command language. Science of Computer Programming, 28(2-3): 171-192, 1997.
21. G. J. Holzmann. The model checker SPIN. Software Engineering, 23(5):279-295, 1997.
22. B. Jeannet, P. D'Argenio, K. Larsen. RAPTURE: A tool for verifying Markov Decision Processes. In Tools Day'02, Technical Report. Masaryk University Brno, 2002.
23. C. Jones. Probabilistic Non-Determinism. PhD thesis, University of Edinburgh, 1990.
24. B. Jonsson, W. Yi, K. G. Larsen. Probabilistic extensions of process algebras. In Handbook of Process Algebra, pages 685-710. Elsevier, 2001.
25. M. Kwiatkowska, G. Norman, D. Parker. PRISM: Probabilistic symbolic model checker. In Comp. Performance Eval. TOOLS, pages 200-204, 2002.
26. L. Lamport. Proving the correctness of multiprocess programs. IEEE Trans. on Softw. Eng., SE-3:2:125-143, 1977.
27. K. G. Larsen, A. Skou. Compositional verification of probabilistic processes. Proc. CONCUR, LNCS 630:456-471, 1992.
28. R. Lipton. Reduction: a method of proving properties of parallel programs. Comm. ACM, 18:717-721, 1975.
29. G. Lowe. Probabilistic and prioritized models of timed CSP. Theoretical Computer Science, 138(2):315-352, 1995.
30. C. Morgan, A. McIver. pgcl: formal reasoning for random algorithms. Proc. WOFACS'98, Spec. Iss. of SACJ, 22:14-27, 1999.
31. S. Owicki. Verifying concurrent programs with shared data classes. Formal Descriptions of Programming Concepts, pages 279-299, 1978.
32. S. Owicki, D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6(4):319-340, 1976.
33. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
34. G. L. Plotkin. An operational semantics for csp. In Proc. of the IFIP Working Group Conference on Programming Concepts II, pages 199-225, 1982.
35. A. Pnueli, L. D. Zuck. Probabilistic verification. Information and Computation, 103(1):l-29, Mar. 1993.
36. M. Puterman. Markov Decision Processes-Discrete Stochastic Dynamic Programming. John Wiley & Sons, 1994.
37. R. Segala, N. Lynch. Probabilistic simulations for probabilistic processes. Nordic J. of Comp., 2(2):250-273, 1995.
38. C. Tofts. A synchronous calculus of relative frequency. Proc. CONCUR'90, LNCS, 458:467-480, 1990.
39. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. Proc. LICS'86, pages 332-344, 1986.