Model checking of probabilistic and nondeterministic systems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Probabilistic mobile ambients
- Polytime model checking for times probabilistic computation tree logic
- A logic for reasoning about time and reliability
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
- Approximating labelled Markov processes
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Automatic verification of real-time systems with discrete probability distributions.
- Symbolic checking of fuzzy CTL on fuzzy program graph
- Verification and control for probabilistic hybrid automata with finite bisimulations
- The complexity of synchronizing Markov decision processes
- Computation tree measurement language (CTML)
- On probabilistic timed automata.
- Quantitative solution of omega-regular games
- A temporal logic for proving properties of topologically general executions
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Deciding bisimilarity and similarity for probabilistic processes.
- Pardinus: a temporal relational model finder
- Model checking QCTL plus on quantum Markov chains
- The satisfiability problem for a quantitative fragment of PCTL
- Automatic verification of concurrent stochastic systems
- Formal verification of robotic cell injection systems up to 4-DOF using \textsf{HOL Light}
- Exact quantitative probabilistic model checking through rational search
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
- Automatic verification of competitive stochastic systems
- Preface to the special issue on probabilistic model checking
- Model checking for probabilistic timed automata
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- Probabilistic \(\mathrm{CTL}^*\): the deductive way
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
- Towards light-weight probabilistic model checking
- Symbolic model checking for probabilistic timed automata
- A survey on temporal logics for specifying and verifying real-time systems
- Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes
- Probabilistic verification and approximation
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems
- Probabilistic temporal logics via the modal mu-calculus
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Model checking discounted temporal properties
- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- Nondeterministic probabilistic Petri net -- a new method to study qualitative and quantitative behaviors of system
- Model checking differentially private properties
- A probabilistic model for the interaction of an agent with a network environment
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
- scientific article; zbMATH DE number 1696496 (Why is no real title available?)
- On-the-fly model checking for extended action-based probabilistic operators
- Efficient decomposition algorithm for stationary analysis of complex stochastic Petri net models
- Group-by-group probabilistic bisimilarities and their logical characterizations
- Can we build it: formal synthesis of control strategies for cooperative driver assistance systems
- Distribution, approximation and probabilistic model checking
- Euclidean model checking: a scalable method for verifying quantitative properties in probabilistic systems
- Weak probabilistic anonymity
- A general framework for probabilistic characterizing formulae
- Verifying pCTL model checking
- Model checking concurrent programs with nondeterminism and randomization
- A Tutorial on Interactive Markov Chains
- On Abstraction of Probabilistic Systems
- Cognitive reasoning and trust in human-robot interactions
- Quantitative multi-objective verification for probabilistic systems
- Bisimulations meet PCTL equivalences for probabilistic automata
- Model checking probabilistic systems
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
- Strict Divergence for Probabilistic Timed Automata
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- Quantitative verification and strategy synthesis for stochastic games
- Model checking failure-prone open systems using probabilistic automata
- Validation of decentralised smart contracts through game theory and formal methods
- Model checking compositional Markov systems.
- Probabilistic CEGAR
- The demand for reliability in probabilistic verification
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata
- Qualitative Logics and Equivalences for Probabilistic Systems
- Quantitative analysis under fairness constraints
- scientific article; zbMATH DE number 4080970 (Why is no real title available?)
- Compositional probabilistic verification through multi-objective model checking
- Safety verification for probabilistic hybrid systems
- Verifying a class of nondeterministic discrete event systems in a generalized temporal logic
- scientific article; zbMATH DE number 176728 (Why is no real title available?)
- Combined model checking for temporal, probabilistic, and real-time logics
- scientific article; zbMATH DE number 1324653 (Why is no real title available?)
- The complexity of probabilistic verification
- scientific article; zbMATH DE number 2079828 (Why is no real title available?)
- scientific article; zbMATH DE number 1497761 (Why is no real title available?)
- scientific article; zbMATH DE number 1507207 (Why is no real title available?)
- Symbolic model checking for probabilistic processes
- Trade-off analysis meets probabilistic model checking
- Model checking with probabilistic tabled logic programming
- scientific article; zbMATH DE number 1400096 (Why is no real title available?)
- Separable GPL: decidable model checking with more non-determinism
- Probabilistic Temporal Logics
- Farkas certificates and minimal witnesses for probabilistic reachability constraints
- Temporal logics for the specification of performance and reliability
- Model checking linear-time properties of probabilistic systems
- scientific article; zbMATH DE number 7559481 (Why is no real title available?)
- Statistical model checking of stochastic component-based systems
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
- Energy-utility analysis for resilient systems using probabilistic model checking
- Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
- On-the-fly probabilistic model checking
This page was built for publication: Model checking of probabilistic and nondeterministic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956706)
