Compositional Model Checking of product-form CTMCs

DOI10.1016/j.entcs.2009.08.003zbMath1339.68163OpenAlexW1992138501WikidataQ62048474 ScholiaQ62048474MaRDI QIDQ2810967

Paolo Ballarini, Andras Horvath

Publication date: 6 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.08.003

zbMATH Keywords

compositional stochastic model checkingproduct-form Markov chains

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of continuous-time Markov processes on discrete state spaces (60J28) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Symbolic model checking: \(10^{20}\) states and beyond
• Model-checking large structured Markov chains.
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Symbolic model checking for probabilistic processes
• Validation of Stochastic Systems
• Model-checking continuous-time Markov chains

This page was built for publication: Compositional Model Checking of product-form CTMCs