Compositional Abstraction Techniques for Probabilistic Automata

DOI10.1007/978-3-642-33475-7_23zbMath1362.68155OpenAlexW106578878WikidataQ57801050 ScholiaQ57801050MaRDI QIDQ2915179

Falak Sher, Joost-Pieter Katoen

Publication date: 21 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33475-7_23

Mathematics Subject Classification ID

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 (3)

Transformations for Compositional Verification of Assumption-Commitment Properties ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Compositional Abstraction Techniques for Probabilistic Automata