Compositional reasoning for parametric probabilistic automata

DOI10.4230/LIPICS.CONCUR.2025.31MaRDI QIDQ7310307zbMATH OpenFDO

Authors Hannah Mertens, Tim Quatmann, Joost-Pieter Katoen

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2025.31

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• Abstraction-Refinement for Hierarchical Probabilistic Models
• Are parametric Markov chains monotonic?
• Assume-guarantee verification for probabilistic systems
• Automated assumption generation for compositional verification
• Automated circular assume-guarantee reasoning
• CEGAR for compositional analysis of qualitative properties in Markov decision processes
• Compositional analysis for verification of parameterized systems
• Compositional parameter synthesis
• Compositional probabilistic verification through multi-objective model checking
• Finding provably optimal Markov chains
• scientific article; zbMATH DE number 1670775 (Why is no real title available?)
• scientific article; zbMATH DE number 4180789 (Why is no real title available?)
• scientific article; zbMATH DE number 5604066 (Why is no real title available?)
• scientific article; zbMATH DE number 3926220 (Why is no real title available?)
• scientific article; zbMATH DE number 1956591 (Why is no real title available?)
• scientific article; zbMATH DE number 1863173 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
• Modular Markovian Logic
• Multi-Objective Model Checking of Markov Decision Processes
• Parameter synthesis for Markov models: covering the parameter space
• Parameter synthesis for Markov models: faster than ever
• Parameterized compositional model checking
• Parametric LTL on Markov chains
• Tentative steps toward a development method for interfering programs
• The complexity of reachability in parametric Markov decision processes
• The probabilistic model checking landscape
• Theoretical Aspects of Computing - ICTAC 2004

This page was built for publication: Compositional reasoning for parametric probabilistic automata

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