Learning-Based Compositional Verification for Synchronous Probabilistic Systems

DOI10.1007/978-3-642-24372-1_40zbMath1348.68135OpenAlexW1665588751MaRDI QIDQ3172942

No author found.

Publication date: 7 October 2011

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

Full work available at URL: https://hal.inria.fr/hal-00647061/file/atva11.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Compositional Reasoning ⋮ When are emptiness and containment decidable for probabilistic automata? ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Unnamed Item ⋮ \(L^\ast\)-based learning of Markov decision processes (extended version) ⋮ Probabilistic black-box reachability checking (extended version)

This page was built for publication: Learning-Based Compositional Verification for Synchronous Probabilistic Systems