Compositional model checking of product-form CTMCs

DOI10.1016/J.ENTCS.2009.08.003zbMATH Open1339.68163DBLPjournals/entcs/BallariniH09OpenAlexW1992138501WikidataQ62048474 ScholiaQ62048474MaRDI QIDQ2810967FDOQ2810967

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

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

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)

Cites Work

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

Cited In (2)

• Formula-dependent equivalence for compositional CTL model checking
• Title not available (Why is that?)

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)