Learning probabilistic systems from tree samples

Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012

Volumn , Issue , 2012, Pages 441-450

  Komuravelli, Anvesh ^a   Pǎsǎreanu, Corina S ^b   Clarke, Edmund M ^a  

^a Carnegie Mellon University ^*  (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

active learning; assume guarantee; conformance; partition; probability; simulation; system; transition; tree

Indexed keywords

ACTIVE LEARNING; ASSUME-GUARANTEE; CONFORMANCE; SIMULATION; SYSTEM; TRANSITION; TREE;

COMPUTATION THEORY; FINITE AUTOMATA; FORESTRY; LEARNING ALGORITHMS; PARTITIONS (BUILDING); PROBABILITY; STOCHASTIC SYSTEMS;

PROBLEM SOLVING;

ALGORITHMS; PROBABILITY; PROBLEM SOLVING; SIMULATION;

EID: 84867147958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2012.54     Document Type: Conference Paper

References (30)

1. L. d. Alfaro, T. A. Henzinger, and R. Jhala, "Compositional Methods for Probabilistic Systems," in CONCUR, ser. LNCS, vol. 2154. London, UK: Springer-Verlag, 2001, pp. 351-365.
2. D. Angluin, "Learning Regular Sets from Queries and Counterexamples," Information and Computation, vol. 75(2), pp. 87-106, Nov. 1987.
3. D. Angluin and C. H. Smith, "Inductive Inference: Theory and Methods," ACM Comp. Surv., vol. 15(3), pp. 237-269, September 1983.
4. C. Baier, B. Engelen, and M. Majster-Cederbaum, "Deciding Bisimilarity and Similarity for Probabilistic Processes," J. Comput. Syst. Sci., vol. 60(1), pp. 187-231, Feb 2000.
5. A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz, and S. Varricchio, "Learning Functions Represented as Multiplicity Automata," J. ACM, vol. 47(3), pp. 506-530, May 2000.
6. R. C. Carrasco and J. Oncina, "Learning Deterministic Regular Grammars From Stochastic Samples in Polynomial Time," RAIRO, vol. 33, pp. 1-20, 1999.
7. R. C. Carrasco, J. Oncina, and J. Calera-Rubio, "Stochastic Inference of Regular Tree Languages," Machine Learning, vol. 44(1-2), pp. 185-197, July 2001.
8. R. Chadha and M. Viswanathan, "A Counterexample-Guided Abstraction-Refinement Framework for Markov Decision Processes," TOCL, vol. 12(1), pp. 1-49, November 2010.
9. S. Chaki, E. M. Clarke, N. Sinha, and P. Thati, "Automated Assume-Guarantee Reasoning for Simulation Conformance," in CAV, ser. LNCS, vol. 3576. Springer-Verlag, 2005, pp. 534-547.
10. Y.-F. Chen, A. Farzan, E. M. Clarke, Y.-K. Tsay, and B.-Y. Wang, "Learning Minimal Separating DFA's for Compositional Verification," in TACAS, ser. LNCS, vol. 5505. Berlin, Heidelberg: Springer-Verlag, 2009, pp. 31-45.
11. E. Clarke, D. Long, and K. McMillan, "Compositional Model Checking," in LICS. Piscataway, NJ, USA: IEEE Press, 1989, pp. 353-362.
12. E. M. Clarke, O. Grumberg, and D. A. Peled, Model Checking. Cambridge, MA, USA: MIT Press, 2000.
13. C. de la Higuera and J. Oncina, "Learning Stochastic Finite Automata," in ICGI, ser. LNCS, vol. 3264. Springer-Verlag, 2004, pp. 175-186.
14. L. Feng, T. Han, M. Kwiatkowska, and D. Parker, "Learning-based Compositional Verification for Synchronous Probabilistic Systems," in ATVA, ser. LNCS, vol. 6996. Berlin, Heidelberg: Springer-Verlag, 2011, pp. 511-521.
15. L. Feng, M. Kwiatkowska, and D. Parker, "Automated Learning of Probabilistic Assumptions for Compositional Reasoning," in FASE, ser. LNCS, vol. 6603. Berlin, Heidelberg: Springer-Verlag, 2011, pp. 2-17.
16. P. Garcia and J. Oncina, "Inference of Recognizable Tree Sets," Universidad Politecnica de, Research Report DSIC - II/47/93, 1993.
17. E. M. Gold, "Complexity of Automaton Identification from Given Data," Information and Control, vol. 37(3), pp. 302-320, 1978.
18. A. Gupta, K. L. McMillan, and Z. Fu, "Automated Assumption Generation for Compositional Verification," FMSD, vol. 32(3), pp. 285-301, June 2008.
19. A. Komuravelli, C. S. Pǎsǎreanu, and E. M. Clarke, "Assume-Guarantee Abstraction Refinement for Probabilistic Systems," in CAV, 2012, (to appear).
20. M. Kwiatkowska, G. Norman, D. Parker, and H. Qu, "Assume-Guarantee Verification for Probabilistic Systems," in TACAS, ser. LNCS, vol. 6015. Berlin, Heidelberg: Springer-Verlag, 2010, pp. 23-37.
21. H. Mao et al., "Learning Probabilistic Automata for Model Checking," in QEST. Washington, DC, USA: IEEE Computer Society, 2011, pp. 111-120.
22. R. Milner, "An Algebraic Definition of Simulation between Programs," Stanford, CA, USA, Tech. Rep., 1971.
23. A. L. Oliveira and J. P. Marques-Silva, "Efficient Search Techniques for the Inference of Minimum Size Finite Automata," in SPIRE. IEEE Computer Society Press, 1998, pp. 81-89.
24. J. Oncina and P. Garcia, "Identifying Regular Languages In Polynomial Time," in ASSPR, vol. 5. World Scientific, 1992, pp. 99-108.
25. A. Pnueli, "In Transition from Global to Modular Temporal Reasoning about Programs," in LMCS, ser. NATO ASI, vol. 13. Springer-Verlag, 1985, pp. 123-144.
26. C. S. Pǎsǎreanu, D. Giannakopoulou, M. G. Bobaru, J. M. Cobleigh, and H. Barringer, "Learning to Divide and Conquer: Applying the L* Algorithm to Automate Assume-Guarantee Reasoning," FMSD, vol. 32(3), pp. 175-205, June 2008.
27. M. O. Rabin, "Probabilistic Automata," Information and Control, vol. 6(3), pp. 230-245, 1963.
28. R. Segala and N. Lynch, "Probabilistic Simulations for Probabilistic Processes," Nordic J. of Computing, vol. 2(2), pp. 250-273, June 1995.
29. W.-G. Tzeng, "Learning Probabilistic Automata and Markov Chains via Queries," Machine Learning, vol. 8(2), pp. 151-166, March 1992.
30. L. Zhang, "Decision Algorithms for Probabilistic Simulations," Ph.D. dissertation, Universität des Saarlandes, 2008.