Compositional model checking of product-form CTMCs

DOI10.1016/J.ENTCS.2009.08.003MaRDI QIDQ2810967zbMATH OpenOpenAlexDBLPWikidataFDO

Authors P. Ballarini, András Horváth

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

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

Recommendations

• Model-checking continuous-time Markov chains
• Model-checking large structured Markov chains.
• Product form solution for a class of PEPA models
• scientific article; zbMATH DE number 1538048
• Synthesis and analysis of product-form Petri nets

Cites work

• scientific article; zbMATH DE number 4180789 (Why is no real title available?)
• scientific article; zbMATH DE number 1884410 (Why is no real title available?)
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Model-checking continuous-time Markov chains
• Model-checking large structured Markov chains.
• Symbolic model checking for probabilistic processes
• Symbolic model checking: \(10^{20}\) states and beyond
• Validation of Stochastic Systems

Cited in

(2)

• Formula-dependent equivalence for compositional CTL model checking
• scientific article; zbMATH DE number 1786478 (Why is no real title available?)

This page was built for publication: Compositional model checking of product-form CTMCs

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