Probabilistic contracts: A compositional reasoning methodology for the design of stochastic systems

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn , Issue , 2010, Pages 223-232

  Delahaye, Benôit ^a   Caillaud, Benôit ^b   Legay, Axel ^b  

^a UNIVERSITÉ DE RENNES 1   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX SYSTEMS; COMPOSITIONAL REASONING; RELIABILITY AND AVAILABILITY; SCALABLE ANALYSIS; VERIFICATION PROBLEMS;

DESIGN; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

MODEL CHECKING;

EID: 77957584148     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2010.13     Document Type: Conference Paper

References (28)

1. E. Clarke, O. Grumberg, and D. Peled, Model Checking. MIT Press, 1999.
2. R. Milner, Communication and Concurrency. Prentice Hall, 1989.
3. A. Benveniste, B. Caillaud, and R. Passerone, "A generic model of contracts for embedded systems," CoRR, vol. abs/0706.1456, 2007.
4. M. Y. Vardi, "Automatic verification of probabilistic concurrent finite-state programs," in FOCS. IEEE, 1985, pp. 327- 338.
5. "Combest," http://www.combest.eu.com.
6. "Speeds," http://www.speeds.eu.com.
7. B. Caillaud, B. Delahaye, K. Larsen, A. Legay, M. Pedersen, and A. Wasowski, "Compositional design methodology with constraint markov chains," INRIA/IRISA Rennes, Tech. Rep., 2009.
8. "The spin tool (spin)," available at http://spinroot.com/spin/ whatispin.html.
9. F. Ciesinski and C. Baier, "Liquor: A tool for qualitative and quantitative linear time analysis of reactive systems," in QEST. IEEE Computer Society, 2006, pp. 131-132.
10. L. de Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, "Model checking discounted temporal properties," in TACAS, ser. LNCS, vol. 2988. Springer, 2004, pp. 77-92.
11. A. Benveniste, B. Caillaud, A. Ferrari, L. Mangeruca, R. Passerone, and C. Sofronis, "Multiple viewpoint contractbased specification and design," in FMCO'07, ser. LNCS, vol. 5382. Springer, October 2008, pp. 200-225.
12. Y. Glouche, P. L. Guernic, J.-P. Talpin, and T. Gautier, "A boolean algebra of contracts for logical assume-guarantee reasoning," CoRR, vol. inria-00292870, 2009. 231.
13. S. Quinton and S. Graf, "Contract-based verification of hierarchical systems of components," in Proc. of the 6th IEEE International Conference on Software Engineering and Formal Methods (SEFM'08). IEEE Computer Society, 2008, pp. 377-381.
14. N. López and M. Núñez, "An overview of probabilistic process algebras and their equivalences," in Validation of Stochastic Systems, ser. LNCS, vol. 2925. Springer, 2004, pp. 89-123.
15. S. Andova, "Process algebra with probabilistic choice," in ARTS, ser. LNCS, vol. 1601. Springer, 1999, pp. 111-129.
16. B. Delahaye, B. Caillaud, and A. Legay, "Compositional Reasoning on (Probabilistic) Contracts," INRIA, Research Report RR-6970, 2009. [Online]. Available: http://hal.inria.fr/inria-00398985/en/.
17. J. R. Büchi, "Weak second-order arithmetic and finite automata," Zeitschrift Math. Logik und Grundlagen der Mathematik, vol. 6, pp. 66-92, 1960.
18. M. Y. Vardi, "From church and prior to psl," 2007, available at http://www.cs.rice.edu/̃vardi/papers/index.html.
19. M. Y. Vardi and P. Wolper, "An automata-theoretic approach to automatic program verification (preliminary report)," in LICS. IEEE Computer Society, 1986, pp. 332-344.
20. "Reasoning about infinite computations," Information and Computation, vol. 115, no. 1, pp. 1-37, 1994.
21. A. Pnueli, "The temporal logic of programs," in FOCS. IEEE, 1977, pp. 46-57.
22. P. Wolper, "Temporal logic can be more expressive," Information and Control, vol. 56, no. 1/2, pp. 72-99, 1983.
23. E. M. Clarke and E. A. Emerson, "Design and synthesis of synchronization skeletons using branching-time temporal logic," in Logic of Programs, ser. LNCS, vol. 131. Springer, 1981, pp. 52-71.
24. C. Eisner and D. Fisman, A Practical Introduction to PSL. Springer, 2006.
25. F. Ciesinski and M. Größer, "On probabilistic computation tree logic," in Validation of Stochastic Systems, ser. LNCS, vol. 2925. Springer, 2004, pp. 147-188.
26. L. de Alfaro, "Formal verification of probabilistic systems," Ph.D. dissertation, Stanford University, 1997.
27. M. Rabin and D. Scott, "Finite automata and their decision problems," IBM Journal of Research and Development, pp. 115-125, 1959.
28. A. Finkel, B. Willems, and P. Wolper, "A direct symbolic approach to model checking pushdown systems," Electr. Notes Theor. Comput. Sci., vol. 9, 1997.