Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems

DOI10.1145/2676726.2676998zbMath1346.68133OpenAlexW1976035665MaRDI QIDQ2819835

Xiao-Wei Gao, Bow-Yaw Wang, Fei He, Li-jun Zhang

Publication date: 29 September 2016

Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2676726.2676998

zbMATH Keywords

compositional verificationalgorithmic learningprobabilistic model checking

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Probabilistic bisimulation for realistic schedulers ⋮ A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees ⋮ Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys ⋮ Probabilistic Bisimulation for Realistic Schedulers ⋮ A novel learning algorithm for Büchi automata based on family of DFAs and classification trees

This page was built for publication: Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems