Holger Hermanns

From MaRDI portal
Person:236071

Available identifiers

zbMath Open hermanns.holgerDBLPh/HolgerHermannsWikidataQ62728990 ScholiaQ62728990MaRDI QIDQ236071

List of research outcomes





PublicationDate of PublicationType
Interval Markov decision processes with multiple objectives: from robust strategies to Pareto curves2024-09-08Paper
A modest approach to Markov automata2024-08-08Paper
Matching distributions under structural constraints2024-05-29Paper
A Modest Approach to Modelling and Checking Markov Automata2024-03-14Paper
A modest Markov automata tutorial2024-03-14Paper
Component-aware input-output conformance2024-02-06Paper
On the foundations of cycles in Bayesian networks2023-08-10Paper
Continuous-time Markov decisions based on partial exploration2023-07-28Paper
Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs2022-11-04Paper
Deep Statistical Model Checking2022-10-13Paper
Admissibility in Probabilistic Argumentation2022-08-02Paper
CONCUR Test-of-time award 2020 announcement2022-07-18Paper
The 10,000 facets of MDP model checking2022-02-16Paper
https://portal.mardi4nfdi.de/entity/Q50284682022-02-09Paper
What do we want from explainable artificial intelligence (XAI)? -- a stakeholder perspective on XAI and a conceptual model guiding interdisciplinary XAI research2021-11-02Paper
Long-Run Rewards for Markov Automata2020-08-05Paper
Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison2020-06-26Paper
On the probabilistic bisimulation spectrum with silent moves2020-05-26Paper
Syntactic partial order compression for probabilistic reachability2020-01-23Paper
Probabilistic Bisimulation for Realistic Schedulers2019-12-19Paper
Multi-objective Robust Strategy Synthesis for Interval Markov Decision Processes2019-09-17Paper
Probabilistic \(\mathrm{CTL}^*\): the deductive way2019-09-17Paper
Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions2019-07-04Paper
The quest for minimal quotients for probabilistic and Markov automata2018-09-27Paper
Probabilistic bisimulation for realistic schedulers2018-09-06Paper
Exploiting robust optimization for interval probabilistic bisimulation2018-01-11Paper
Cost vs. time in stochastic games and Markov automata2017-09-08Paper
Cost vs. Time in Stochastic Games and Markov Automata2017-08-31Paper
Is Your Software on Dope?2017-05-19Paper
Measurability and safety verification for stochastic hybrid systems2017-05-16Paper
Rewarding probabilistic hybrid automata2017-05-16Paper
Verification of Open Interactive Markov Chains2017-01-26Paper
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time2017-01-26Paper
Probabilistic termination: soundness, completeness, and compositionality2016-09-29Paper
Distributed Synthesis in Continuous Time2016-06-10Paper
Deciding probabilistic automata weak bisimulation: theory and practice2016-05-12Paper
Compositional Bisimulation Minimization for Interval Markov Decision Processes2016-04-13Paper
Reward-Bounded Reachability Probability for Uncertain Weighted MDPs2016-03-23Paper
Schedulers are no Prophets2016-03-23Paper
Optimal Continuous Time Markov Decisions2016-01-08Paper
Explicit Model Checking of Very Large MDP Using Partitioning and Secondary Storage2016-01-08Paper
Improving Time Bounded Reachability Computations in Interactive Markov Chains2015-09-30Paper
Polynomial time decision algorithms for probabilistic automata2015-09-28Paper
YMCA2015-07-10Paper
Bisimulation and Simulation Relations for Markov Chains2015-07-10Paper
Abstraction-Based Computation of Reward Measures for Markov Automata2015-02-04Paper
Cost Preserving Bisimulations for Probabilistic Automata2015-01-15Paper
Analysis of timed and long-run objectives for Markov automata2014-09-30Paper
Probabilistic Bisimulation: Naturally on Distributions2014-09-15Paper
A compositional modelling and analysis framework for stochastic hybrid systems2014-06-30Paper
Deciding Bisimilarities on Distributions2014-05-12Paper
Safety verification for probabilistic hybrid systems2014-01-21Paper
Model checking for performability2013-08-26Paper
Cost Preserving Bisimulations for Probabilistic Automata2013-08-12Paper
Compositional Verification and Optimization of Interactive Markov Chains2013-08-12Paper
The Quest for Minimal Quotients for Probabilistic Automata2013-08-05Paper
A Semantics for Every GSPN2013-06-28Paper
Bounding the equilibrium distribution of Markov population models2012-12-19Paper
Variable Probabilistic Abstraction Refinement2012-11-21Paper
Efficient CSL model checking using stratification2012-08-15Paper
Automata-Based CSL Model Checking2011-07-07Paper
A Probabilistic Extension of UML Statecharts2011-04-08Paper
https://portal.mardi4nfdi.de/entity/Q30869192011-03-30Paper
Probabilistic logical characterization2011-02-21Paper
The How and Why of Interactive Markov Chains2011-01-08Paper
Superposition-Based Analysis of First-Order Probabilistic Timed Automata2010-10-12Paper
Concurrency and Composition in a Stochastic World2010-08-31Paper
Performability assessment by model checking of Markov reward models2010-05-05Paper
CONCUR 2003 - Concurrency Theory2010-03-30Paper
Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains2010-02-05Paper
Probabilistic weak simulation is decidable in polynomial time2009-07-09Paper
Towards Performance Prediction of Compositional Models in Industrial GALS Designs2009-06-30Paper
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations2009-04-29Paper
Optimal state-space lumping in Markov chains2009-04-28Paper
Teaching Concurrency Concepts to Freshmen2009-02-03Paper
On the Minimisation of Acyclic Models2008-11-25Paper
Sigref – A Symbolic Bisimulation Tool Box2008-09-04Paper
Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems2008-09-02Paper
Probabilistic CEGAR2008-07-15Paper
Deciding Simulations on Probabilistic Automata2008-07-03Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-09-28Paper
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations2007-09-03Paper
Formal Modeling and Analysis of Timed Systems2006-11-14Paper
Formal Methods for the Design of Real-Time Systems2006-10-19Paper
Formal Techniques for Networked and Distributed Systems - FORTE 20052006-07-07Paper
Formal Modeling and Analysis of Timed Systems2006-01-10Paper
Axiomatising divergence2006-01-10Paper
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes2005-12-06Paper
Comparative branching-time semantics for Markov chains2005-09-02Paper
https://portal.mardi4nfdi.de/entity/Q46657392005-04-11Paper
https://portal.mardi4nfdi.de/entity/Q48088422004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47371912004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44719332004-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44179432003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44110902003-07-07Paper
https://portal.mardi4nfdi.de/entity/Q44844972003-06-12Paper
https://portal.mardi4nfdi.de/entity/Q47980362003-03-18Paper
https://portal.mardi4nfdi.de/entity/Q47980322003-03-18Paper
https://portal.mardi4nfdi.de/entity/Q47912662003-02-06Paper
Interactive Markov chains. And the quest for quantified quality2002-11-07Paper
https://portal.mardi4nfdi.de/entity/Q45477672002-08-21Paper
Process algebra for performance evaluation2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27540962001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q27541962001-11-11Paper
Construction and verification of performance and reliability models2001-09-27Paper
https://portal.mardi4nfdi.de/entity/Q45189042000-12-03Paper
Automated compositional Markov chain generation for a plain-old telephone system2000-07-10Paper
https://portal.mardi4nfdi.de/entity/Q42700552000-04-25Paper
https://portal.mardi4nfdi.de/entity/Q49368932000-02-01Paper
https://portal.mardi4nfdi.de/entity/Q42555531999-08-17Paper
https://portal.mardi4nfdi.de/entity/Q42519171999-06-17Paper

Research outcomes over time

This page was built for person: Holger Hermanns