The following pages link to Joost-Pieter Katoen (Q236073):
Displaying 50 items.
- Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking (Q3510805) (← links)
- Abstraction of Probabilistic Systems (Q3510828) (← links)
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains (Q3523111) (← links)
- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes (Q3525652) (← links)
- Abstraction for Stochastic Systems by Erlang’s Method of Stages (Q3541024) (← links)
- Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains (Q3543299) (← links)
- Safety and Liveness in Concurrent Pointer Programs (Q3591397) (← links)
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes (Q3617741) (← links)
- LTL Model Checking of Time-Inhomogeneous Markov Chains (Q3648693) (← links)
- Compositional Abstraction for Stochastic Systems (Q3648832) (← links)
- (Q4255553) (← links)
- (Q4270055) (← links)
- (Q4411090) (← links)
- (Q4471933) (← links)
- (Q4484497) (← links)
- (Q4518904) (← links)
- (Q4547773) (← links)
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms (Q4625651) (← links)
- Zero-reachability in probabilistic multi-counter automata (Q4635605) (← links)
- Probably safe or live (Q4635640) (← links)
- The Probabilistic Model Checking Landscape (Q4635859) (← links)
- On the Satisfiability of Some Simple Probabilistic Logics (Q4635861) (← links)
- Reasoning about Recursive Probabilistic Programs (Q4635928) (← links)
- (Q4762660) (← links)
- (Q4791266) (← links)
- (Q4798032) (← links)
- (Q4798036) (← links)
- Linear-Invariant Generation for Probabilistic Programs: (Q4930741) (← links)
- Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions (Q4990151) (← links)
- Scenario-Based Verification of Uncertain MDPs (Q5039513) (← links)
- Simple Strategies in Multi-Objective MDPs (Q5039517) (← links)
- Causal behaviours and nets (Q5096367) (← links)
- Design and analysis of dynamic leader election protocols in broadcast networks (Q5137017) (← links)
- (Q5144701) (← links)
- Expected Runtime Analyis by Program Verification (Q5150950) (← links)
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773) (← links)
- Modal Stochastic Games (Q5217312) (← links)
- High-level Counterexamples for Probabilistic Automata (Q5246720) (← links)
- Bisimulation and Simulation Relations for Markov Chains (Q5262953) (← links)
- YMCA (Q5262955) (← links)
- A Semantics for Every GSPN (Q5300867) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308389) (← links)
- (Q5322945) (← links)
- Fault Trees on a Diet (Q5351872) (← links)
- A Probabilistic Extension of UML Statecharts (Q5392299) (← links)
- Three-Valued Abstraction for Continuous-Time Markov Chains (Q5429326) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465858) (← links)
- Formal Methods for the Design of Real-Time Systems (Q5494312) (← links)
- Formal Modeling and Analysis of Timed Systems (Q5717503) (← links)
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking (Q5758103) (← links)
