Checking continuous stochastic logic against quantum continuous-time Markov chains
From MaRDI portal
Cites work
- A new scaling and squaring algorithm for the matrix exponential
- A probabilistic logic for verifying continuous-time Markov chains
- A sample-driven solving procedure for the repeated reachability of quantum continuous-time Markov chains
- Algorithms in real algebraic geometry
- Automata-based CSL model checking
- Completely positive dynamical semigroups of N-level systems
- Decomposition of quantum Markov chains and its applications
- Efficient CSL model checking using stratification
- Finite State Continuous Time Markov Decision Processes with a Finite Planning Horizon
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1612487 (Why is no real title available?)
- scientific article; zbMATH DE number 1670788 (Why is no real title available?)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3920595 (Why is no real title available?)
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- scientific article; zbMATH DE number 3465382 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1361121 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 7730615 (Why is no real title available?)
- Model checking -regular properties for quantum Markov chains
- Model checking quantum Markov chains
- Model checking quantum systems. Principles and algorithms
- Multiphase until formulas over Markov reward models: an algebraic approach
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- On decidability of time-bounded reachability in CTMDPs
- On the generators of quantum dynamical semigroups
- On the Skolem problem for continuous linear dynamical systems
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
- Quantum weakest preconditions
- Reachability analysis of quantum Markov decision processes
- Reachability Probabilities of Quantum Markov Chains
- Towards a quantum programming language
Cited in
(1)
This page was built for publication: Checking continuous stochastic logic against quantum continuous-time Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858430)