The following pages link to Ralf Wimmer (Q402121):
Displaying 23 items.
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- From DQBF to QBF by dependency elimination (Q1680263) (← links)
- Skolem functions for DQBF (Q1990517) (← links)
- Solving dependency quantified Boolean formulas using quantifier localization (Q2148900) (← links)
- Cost vs. time in stochastic games and Markov automata (Q2403526) (← links)
- Dependency Schemes for DQBF (Q2818034) (← links)
- Minimal Critical Subsystems for Discrete-Time Markov Models (Q2894278) (← links)
- Hierarchical Counterexamples for Discrete-Time Markov Chains (Q3172933) (← links)
- Long-Run Rewards for Markov Automata (Q3303930) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- Fast Debugging of PRISM Models (Q3457786) (← links)
- Sigref – A Symbolic Bisimulation Tool Box (Q3522930) (← links)
- (Q3528912) (← links)
- Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking (Q3600486) (← links)
- Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions (Q4990151) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- Abstraction-Based Computation of Reward Measures for Markov Automata (Q5172642) (← links)
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773) (← links)
- A Computational Perspective of the Role of the Thalamus in Cognition (Q5214351) (← links)
- High-level Counterexamples for Probabilistic Automata (Q5246720) (← links)
- Cost vs. Time in Stochastic Games and Markov Automata (Q5351873) (← links)
- Experimental and Efficient Algorithms (Q5710044) (← links)
- Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications (Q5889312) (← links)
