Extended Directed Search for Probabilistic Timed Reachability

DOI10.1007/11867340_4MaRDI QIDQ3511221zbMATH OpenOpenAlexFDO

Authors Husain Aljazzar, Stefan Leue

Publication date 8 July 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-57832

Mathematics Subject Classification ID

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

Recommendations

• Formal Modeling and Analysis of Timed Systems
• Stochastic model checking
• Fast debugging of PRISM models
• Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking
• Constraint-based debugging in probabilistic model checking

Cited in

(9)

• Conditional Probabilities over Probabilistic and Nondeterministic Systems
• Minimal counterexamples for linear-time probabilistic verification
• Survey on Directed Model Checking
• Formal Modeling and Analysis of Timed Systems
• Counterexample generation for discrete-time Markov models: an introductory survey
• Farkas certificates and minimal witnesses for probabilistic reachability constraints
• Counterexamples in Probabilistic LTL Model Checking for Markov Chains
• scientific article; zbMATH DE number 1361118 (Why is no real title available?)
• Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking

Describes a project that uses

Uses Software

• MRMC
• SPIN
• PRISM

This page was built for publication: Extended Directed Search for Probabilistic Timed Reachability

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