Learning-based compositional verification for synchronous probabilistic systems

DOI10.1007/978-3-642-24372-1_40MaRDI QIDQ3172942zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems
• Assume-guarantee verification for probabilistic systems
• Computer Aided Verification
• scientific article; zbMATH DE number 1956591
• Compositional probabilistic verification through multi-objective model checking

Cited in

(17)

• Abstraction-Refinement for Hierarchical Probabilistic Models
• Learning probabilistic systems from tree samples
• A Proof System for Compositional Verification of Probabilistic Concurrent Processes
• Compositional probabilistic verification through multi-objective model checking
• \(L^\ast\)-based learning of Markov decision processes (extended version)
• Compositional automata learning of synchronous systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Probabilistic black-box reachability checking (extended version)
• \(L^*\)-based learning of Markov decision processes
• Assume-guarantee verification for probabilistic systems
• Learning deterministic probabilistic automata from a model checking perspective
• Learning-based compositional parameter synthesis for event-recording automata
• When is containment decidable for probabilistic automata?
• When are emptiness and containment decidable for probabilistic automata?
• Compositional reasoning
• Abstraction and learning for infinite-state compositional verification
• A Context-Free Symbiosis of Runtime Verification and Automata Learning

This page was built for publication: Learning-based compositional verification for synchronous probabilistic systems

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