scientific article; zbMATH DE number 1884411

From MaRDI portal
Publication:4798031

zbMath1007.68131MaRDI QIDQ4798031

Henrik Ejersbo Jensen, Bertrand Jeannet, Kim Guldstrand Larsen, Pedro R. D'Argenio

Publication date: 18 March 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2165/21650039.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (25)

Farkas Certificates and Minimal Witnesses for Probabilistic Reachability ConstraintsLatticed \(k\)-induction with an application to probabilistic programsLeast upper bounds for probability measures and their applications to abstractionsA game-based abstraction-refinement framework for Markov decision processesAnalyzing Oscillatory Behavior with Formal MethodsOn Abstraction of Probabilistic SystemsSafety verification for probabilistic hybrid systemsMinimal counterexamples for linear-time probabilistic verificationBounded Verification of Reachability of Probabilistic Hybrid SystemsOn the use of MTBDDs for performability analysis and verification of stochastic systems.Generating probabilistic safety guarantees for neural network controllersAbstract model repair for probabilistic systemsThree-valued abstraction for probabilistic systemsLocal abstraction refinement for probabilistic timed programsAre Parametric Markov Chains Monotonic?Approximating Probabilistic Behaviors of Biological Systems Using Abstract InterpretationAlgorithmic probabilistic game semantics. Playing games with automataGame-Based Probabilistic Predicate Abstraction in PRISMReachability in parametric interval Markov chains using constraintsCEGAR for compositional analysis of qualitative properties in Markov decision processesProbabilistic Model Checking of Biological Systems with Uncertain Kinetic RatesA linear process-algebraic format with data for probabilistic automataProbabilistic model checking of biological systems with uncertain kinetic ratesStatistical verification of PCTL using antithetic and stratified samplesOn finite-state approximants for probabilistic computation tree logic




This page was built for publication: