A Probabilistic Learning Approach for Counterexample Guided Abstraction Refinement

DOI10.1007/11901914_6zbMATH Open1161.68722OpenAlexW1600074484MaRDI QIDQ3522892FDOQ3522892

Xiaoyu Song, Fei He, Ming Gu, Jiaguang Sun

Publication date: 4 September 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11901914_6

Recommendations

• A counterexample-guided abstraction-refinement framework for Markov decision processes
• Probabilistic CEGAR
• scientific article; zbMATH DE number 2087616
• scientific article; zbMATH DE number 1670775
• scientific article; zbMATH DE number 1903358

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (2)

• Automata Learning through Counterexample Guided Abstraction Refinement
• Clustering-Guided SMT($$\mathcal {L\!R\!A}$$) Learning

This page was built for publication: A Probabilistic Learning Approach for Counterexample Guided Abstraction Refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522892)