LiQuor

swMATH4136MaRDI QIDQ16320FDOQ16320

Author name not available (Why is that?)

Cited In (19)

• Minimal counterexamples for linear-time probabilistic verification
• Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement
• Observing continuous-time MDPs by 1-clock timed automata
• Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
• Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
• Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
• Model checking probabilistic systems
• Undecidability results for distributed probabilistic systems
• Game-Based Probabilistic Predicate Abstraction in PRISM
• Compositional probabilistic verification through multi-objective model checking
• Obligation Blackwell games and p-automata
• 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
• Coupling and importance sampling for statistical model checking
• Title not available (Why is that?)
• Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
• Verification of partial-information probabilistic systems using counterexample-guided refinements
• Model Checking Quantitative Linear Time Logic

This page was built for software: LiQuor