Fast debugging of PRISM models

DOI10.1007/978-3-319-11936-6_11MaRDI QIDQ3457786zbMATH OpenOpenAlexFDO

Authors Christian Dehnert, Nils Jansen, Ralf Wimmer, Erika Ábrahám, Joost-Pieter Katoen

Publication date 17 December 2015

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11936-6_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• High-level counterexamples for probabilistic automata
• Constraint-based debugging in probabilistic model checking
• A Debugging Game for Probabilistic Models
• scientific article; zbMATH DE number 2080040
• scientific article; zbMATH DE number 2087806

Cited in

(6)

• High-level counterexamples for probabilistic automata
• Counterexample-guided inductive synthesis for probabilistic systems
• A Debugging Game for Probabilistic Models
• Inductive synthesis for probabilistic programs reaches new horizons
• Extended Directed Search for Probabilistic Timed Reachability
• Counterexample-driven synthesis for probabilistic program sketches

Describes a project that uses

Uses Software

• z3
• Gurobi
• PRISM

This page was built for publication: Fast debugging of PRISM models

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