Quantitative analysis of distributed randomized protocols

FMICS'05 - Proceedings of the Tenth International Workshop on Formal Methods for Industrial Critical Systems

Volumn , Issue , 2005, Pages 2-7

  Baier, Christel ^a   Ciesinski, Frank ^a   Groesser, Marcus ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Languages; Reliability; Theory; Verification

Indexed keywords

COMPUTATION THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBABILISTIC LOGICS; PROBABILITY; QUERY LANGUAGES;

IMPERATIVE LANGUAGES; LOGICAL SPECIFICATIONS; LOSSY CHANNELS; RANDOMIZED PROTOCOLS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33749031848     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081180.1081182     Document Type: Conference Paper

References (29)

1. C. Baier, F. Ciesinski, and M. Größer. Probmela: a modeling language for communicating probabilistic systems. MEMOCODE'04, pages 57-66. IEEE CS Press, 2004.
2. C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. ICALP'97, LNCS 1256, pages 430-440, 1997.
3. C. Baier, P. D'Argenio, and M. Größer. Partial order reduction for probabilistic branching time. QAPL'05, To appear in ENTCS.
4. C. Baier, M. Größer, and F. Ciesinski. Partial order reduction for probabilistic systems. QEST'04, IEEE CS Press, pages 230-239, 2004.
5. C. Baier, B. Haverkort, H. Hermanns, J.-P. Katoen, and M. Siegle, editors. Validation of Stochastic Systems, LNCS 2925, 2003.
6. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11:125-155, 1998.
7. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. FST & TCS'95, LNCS 1026, pages 499-513, 1995.
8. 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.
9. C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events (extended abstract). ICALP'90, LNCS 443, pages 336-349, 1990.
10. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
11. P.R. D'Argenio and P. Niebert. Partial order reduction on concurrent probabilistic programs. QEST'04, IEEE CS Press, pages 230-239, 2004.
12. L. de Alfaro. Temporal logics for the specification of performance and reliability. STACS'97, LNCS 1200, pages 165-179, 1997.
13. L. de Alfaro. Formal Verification of Probabilistic Systems. Ph.D. thesis, Stanford University , 1997.
14. E. Dijkstra. Guarded commands, non-determinacy and the formal derivation of programs. Comm. ACM, 18:453-457, 1975
15. P. Godefroid. On the costs and benefits of using partial-order methods for the verification of concurrent systems. In [26], pages 289-303, 1996.
16. P. Godefroid. Partial Order Methods for the Verification of Concurrent Systems: An Approach to the State Explosion Problem, LNCS 1032, 1996.
17. G. Holzmann. The SPIN Model Checker, Primer and Reference Manual. Add.Wes., 2003.
18. A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Inf. Comput., 88(1):60-87, 1990.
19. B.Jeannet, P.d'Argenio and K.G. Larsen. RAPTURE: A tool for verifying Markov Decision Processes. Proc.Tools Day/CONCUR'02. Tech.Rep. FIMU-RS-2002-05,84-98, 2002.
20. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with prism: A hybrid approach. International Journal on Software Tools for Technology Transfer (STTT), to appear, 2004.
21. N. Lynch. Distributed Algorithms. Morgan Kaufmann, San Francisco, CS, 1996. MIT.
22. C. Morgan and A. McIver. pGCL: formal reasoning for random algorithms. Proc. WOFACS'98, Spec. Iss.of SACJ, 22:14-27, 1999.
23. C. Morgan and A. McIver. Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science. Springer, 2005.
24. Terence Parr. The ANTLR Reference Manual. 2.6 edition, 1999.
25. D. Peled. Partial order reduction: Linear and branching time logics and process algebras. In [26], pages 79-88, 1996.
26. D. Peled, V. Pratt, and G. Holzmann, editors. Partial Order Methods in Verification, volume 29(10) of DIMACS. American Mathematical Society, 1997.
27. A. Valmari. Stubborn set methods for process algebras. In [26], pages 79-88, 1996.
28. M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. FOCS'85, IEEE CS Press, pages 327-338, 1985.
29. M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). LICS'86, pages 332-344, IEEE Computer Society Press, 1986.