LiQuor

swMATH4136MaRDI QIDQ16320FDOQ16320

Author name not available (Why is that?)

Cited In (19)

• Coupling and Importance Sampling for Statistical Model Checking
• Minimal counterexamples for linear-time probabilistic verification
• Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement
• OBLIGATION BLACKWELL GAMES AND P-AUTOMATA
• Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
• Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
• Game-Based Probabilistic Predicate Abstraction in PRISM
• Observing Continuous-Time MDPs by 1-Clock Timed Automata
• Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements
• Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains
• Compositional probabilistic verification through multi-objective model checking
• Model Checking Probabilistic Systems
• Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects
• On simulation-based probabilistic model checking of mixed-analog circuits
• Algorithmic probabilistic game semantics. Playing games with automata
• Undecidability Results for Distributed Probabilistic Systems
• Title not available (Why is that?)
• Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
• Model Checking Quantitative Linear Time Logic

This page was built for software: LiQuor