Pages that link to "Item:Q402125"
From MaRDI portal
The following pages link to Minimal counterexamples for linear-time probabilistic verification (Q402125):
Displaying 9 items.
- Enforcing almost-sure reachability in POMDPs (Q832296) (← links)
- On minimising the maximum expected verification time (Q1675917) (← links)
- Counterexample-guided inductive synthesis for probabilistic systems (Q1982641) (← links)
- Task-Aware Verifiable RNN-Based Policies for Partially Observable Markov Decision Processes (Q5026215) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties (Q5277794) (← links)
- Model Checking Software (Q5308368) (← links)
- On relative and probabilistic finite counterability (Q5351957) (← links)
- Witnessing subsystems for probabilistic systems with low tree width (Q6649513) (← links)