The following pages link to Holger Hermanns (Q236071):
Displaying 50 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Safety verification for probabilistic hybrid systems (Q389835) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Probabilistic logical characterization (Q627128) (← links)
- Interactive Markov chains. And the quest for quantified quality (Q701689) (← links)
- Performability assessment by model checking of Markov reward models (Q968359) (← links)
- Optimal state-space lumping in Markov chains (Q1014448) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Probabilistic bisimulation for realistic schedulers (Q1671244) (← links)
- Exploiting robust optimization for interval probabilistic bisimulation (Q1693117) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Automated compositional Markov chain generation for a plain-old telephone system (Q1969600) (← links)
- The 10,000 facets of MDP model checking (Q2075778) (← links)
- On the probabilistic bisimulation spectrum with silent moves (Q2182668) (← links)
- What do we want from explainable artificial intelligence (XAI)? -- a stakeholder perspective on XAI and a conceptual model guiding interdisciplinary XAI research (Q2238577) (← links)
- A compositional modelling and analysis framework for stochastic hybrid systems (Q2248073) (← links)
- Probabilistic \(\mathrm{CTL}^*\): the deductive way (Q2272920) (← links)
- Syntactic partial order compression for probabilistic reachability (Q2287108) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Cost vs. time in stochastic games and Markov automata (Q2403526) (← links)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731) (← links)
- Axiomatising divergence (Q2581532) (← links)
- (Q2743687) (← links)
- (Q2754096) (← links)
- (Q2754196) (← links)
- Reward-Bounded Reachability Probability for Uncertain Weighted MDPs (Q2796060) (← links)
- Schedulers are no Prophets (Q2796225) (← links)
- Compositional Bisimulation Minimization for Interval Markov Decision Processes (Q2798714) (← links)
- Distributed Synthesis in Continuous Time (Q2811352) (← links)
- Probabilistic Termination (Q2819834) (← links)
- Compositional Verification and Optimization of Interactive Markov Chains (Q2842120) (← links)
- Model checking for performability (Q2843861) (← links)
- Efficient CSL Model Checking Using Stratification (Q2904612) (← links)
- Analysis of Timed and Long-Run Objectives for Markov Automata (Q2921114) (← links)
- Improving Time Bounded Reachability Computations in Interactive Markov Chains (Q2948248) (← links)
- Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time (Q2957519) (← links)
- Verification of Open Interactive Markov Chains (Q2957522) (← links)
- Measurability and safety verification for stochastic hybrid systems (Q2986712) (← links)
- Rewarding probabilistic hybrid automata (Q2986936) (← links)
- Is Your Software on Dope? (Q2988635) (← links)
- Automata-Based CSL Model Checking (Q3012926) (← links)
- The How and Why of Interactive Markov Chains (Q3066128) (← links)
- (Q3086919) (← links)
- Probabilistic Bisimulation: Naturally on Distributions (Q3190122) (← links)
- Bounding the equilibrium distribution of Markov population models (Q4897510) (← links)
- CONCUR Test-of-time award 2020 announcement (Q5089268) (← links)
- Admissibility in Probabilistic Argumentation (Q5094045) (← links)
- Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison (Q5114783) (← links)
- Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions (Q5222942) (← links)
- Bisimulation and Simulation Relations for Markov Chains (Q5262953) (← links)
