| Publication | Date of Publication | Type |
|---|
Interval Markov decision processes with multiple objectives: from robust strategies to Pareto curves
ACM Transactions on Modeling and Computer Simulation | 2024-09-08 | Paper |
A modest approach to Markov automata
ACM Transactions on Modeling and Computer Simulation | 2024-08-08 | Paper |
Matching distributions under structural constraints
| 2024-05-29 | Paper |
A Modest Approach to Modelling and Checking Markov Automata
| 2024-03-14 | Paper |
A modest Markov automata tutorial
| 2024-03-14 | Paper |
Component-aware input-output conformance
Formal Techniques for Distributed Objects, Components, and Systems | 2024-02-06 | Paper |
On the foundations of cycles in Bayesian networks
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Continuous-time Markov decisions based on partial exploration
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
Polynomial-time alternating probabilistic bisimulation for interval MDPs
Dependable Software Engineering. Theories, Tools, and Applications | 2022-11-04 | Paper |
Deep statistical model checking
Formal Techniques for Distributed Objects, Components, and Systems | 2022-10-13 | Paper |
Admissibility in Probabilistic Argumentation
Journal of Artificial Intelligence Research | 2022-08-02 | Paper |
CONCUR Test-of-time award 2020 announcement
| 2022-07-18 | Paper |
The 10,000 facets of MDP model checking
| 2022-02-16 | Paper |
scientific article; zbMATH DE number 7471703 (Why is no real title available?)
| 2022-02-09 | Paper |
What do we want from explainable artificial intelligence (XAI)? -- a stakeholder perspective on XAI and a conceptual model guiding interdisciplinary XAI research
Artificial Intelligence | 2021-11-02 | Paper |
Long-Run Rewards for Markov Automata
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison
Journal of Artificial Intelligence Research | 2020-06-26 | Paper |
On the probabilistic bisimulation spectrum with silent moves
Acta Informatica | 2020-05-26 | Paper |
Syntactic partial order compression for probabilistic reachability
| 2020-01-23 | Paper |
Probabilistic bisimulation for realistic schedulers
FM 2015: Formal Methods | 2019-12-19 | Paper |
Multi-objective Robust Strategy Synthesis for Interval Markov Decision Processes
Quantitative Evaluation of Systems | 2019-09-17 | Paper |
Probabilistic \(\mathrm{CTL}^*\): the deductive way
| 2019-09-17 | Paper |
Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions
EPiC Series in Computing | 2019-07-04 | Paper |
The quest for minimal quotients for probabilistic and Markov automata
Information and Computation | 2018-09-27 | Paper |
Probabilistic bisimulation for realistic schedulers
Acta Informatica | 2018-09-06 | Paper |
Exploiting robust optimization for interval probabilistic bisimulation
| 2018-01-11 | Paper |
Cost vs. time in stochastic games and Markov automata
Formal Aspects of Computing | 2017-09-08 | Paper |
Cost vs. Time in Stochastic Games and Markov Automata
Dependable Software Engineering: Theories, Tools, and Applications | 2017-08-31 | Paper |
Is Your Software on Dope?
Programming Languages and Systems | 2017-05-19 | Paper |
Measurability and safety verification for stochastic hybrid systems
Proceedings of the 14th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Rewarding probabilistic hybrid automata
Proceedings of the 16th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Verification of open interactive Markov chains
| 2017-01-26 | Paper |
Deciding probabilistic automata weak bisimulation in polynomial time
| 2017-01-26 | Paper |
Probabilistic termination: soundness, completeness, and compositionality
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
Distributed synthesis in continuous time
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Deciding probabilistic automata weak bisimulation: theory and practice
Formal Aspects of Computing | 2016-05-12 | Paper |
Compositional bisimulation minimization for interval Markov decision processes
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Reward-bounded reachability probability for uncertain weighted MDPs
Lecture Notes in Computer Science | 2016-03-23 | Paper |
Schedulers are no prophets
Semantics, Logics, and Calculi | 2016-03-23 | Paper |
Optimal continuous time Markov decisions
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
Explicit model checking of very large MDP using partitioning and secondary storage
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
Improving time bounded reachability computations in interactive Markov chains
Fundamentals of Software Engineering | 2015-09-30 | Paper |
Polynomial time decision algorithms for probabilistic automata
Information and Computation | 2015-09-28 | Paper |
YMCA: why Markov chain algebra?
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
Bisimulation and Simulation Relations for Markov Chains
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
Abstraction-based computation of reward measures for Markov automata
Lecture Notes in Computer Science | 2015-02-04 | Paper |
Cost preserving bisimulations for probabilistic automata
Logical Methods in Computer Science | 2015-01-15 | Paper |
Analysis of timed and long-run objectives for Markov automata
Logical Methods in Computer Science | 2014-09-30 | Paper |
Probabilistic Bisimulation: Naturally on Distributions
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
A compositional modelling and analysis framework for stochastic hybrid systems
Formal Methods in System Design | 2014-06-30 | Paper |
Deciding bisimilarities on distributions
Quantitative Evaluation of Systems | 2014-05-12 | Paper |
Safety verification for probabilistic hybrid systems
European Journal of Control | 2014-01-21 | Paper |
Model checking for performability
MSCS. Mathematical Structures in Computer Science | 2013-08-26 | Paper |
Cost preserving bisimulations for probabilistic automata
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Compositional verification and optimization of interactive Markov chains
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
The quest for minimal quotients for probabilistic automata
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
A semantics for every GSPN
Application and Theory of Petri Nets and Concurrency | 2013-06-28 | Paper |
Bounding the equilibrium distribution of Markov population models.
Numerical Linear Algebra with Applications | 2012-12-19 | Paper |
Variable probabilistic abstraction refinement
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Efficient CSL model checking using stratification
Logical Methods in Computer Science | 2012-08-15 | Paper |
Automata-based CSL model checking
Automata, Languages and Programming | 2011-07-07 | Paper |
A probabilistic extension of UML statecharts specification and verification
Lecture Notes in Computer Science | 2011-04-08 | Paper |
Reachability in continuous-time Markov reward decision processes
| 2011-03-30 | Paper |
Probabilistic logical characterization
Information and Computation | 2011-02-21 | Paper |
The how and why of interactive Markov chains
Formal Methods for Components and Objects | 2011-01-08 | Paper |
Superposition-based analysis of first-order probabilistic timed automata
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Concurrency and composition in a stochastic world
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
Performability assessment by model checking of Markov reward models
Formal Methods in System Design | 2010-05-05 | Paper |
CONCUR 2003 - Concurrency Theory
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Time-bounded model checking of infinite-state continuous-time Markov chains
Fundamenta Informaticae | 2010-02-05 | Paper |
Probabilistic weak simulation is decidable in polynomial time
Information Processing Letters | 2009-07-09 | Paper |
Towards Performance Prediction of Compositional Models in Industrial GALS Designs
Computer Aided Verification | 2009-06-30 | Paper |
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Logical Methods in Computer Science | 2009-04-29 | Paper |
Optimal state-space lumping in Markov chains
Information Processing Letters | 2009-04-28 | Paper |
Teaching Concurrency Concepts to Freshmen
Transactions on Petri Nets and Other Models of Concurrency I | 2009-02-03 | Paper |
On the Minimisation of Acyclic Models
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Sigref – A Symbolic Bisimulation Tool Box
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
Hybrid Systems: Computation and Control | 2008-09-02 | Paper |
Probabilistic CEGAR
Computer Aided Verification | 2008-07-15 | Paper |
Deciding Simulations on Probabilistic Automata
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Formal Methods for the Design of Real-Time Systems
Lecture Notes in Computer Science | 2006-10-19 | Paper |
Formal Techniques for Networked and Distributed Systems - FORTE 2005
| 2006-07-07 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Axiomatising divergence
Information and Computation | 2006-01-10 | Paper |
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
Theoretical Computer Science | 2005-12-06 | Paper |
Comparative branching-time semantics for Markov chains
Information and Computation | 2005-09-02 | Paper |
scientific article; zbMATH DE number 2155192 (Why is no real title available?)
| 2005-04-11 | Paper |
scientific article; zbMATH DE number 2090149 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2086654 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2079828 (Why is no real title available?)
| 2004-07-30 | Paper |
scientific article; zbMATH DE number 1956597 (Why is no real title available?)
| 2003-07-30 | Paper |
scientific article; zbMATH DE number 1946767 (Why is no real title available?)
| 2003-07-07 | Paper |
scientific article; zbMATH DE number 1927572 (Why is no real title available?)
| 2003-06-12 | Paper |
scientific article; zbMATH DE number 1884414 (Why is no real title available?)
| 2003-03-18 | Paper |
scientific article; zbMATH DE number 1884412 (Why is no real title available?)
| 2003-03-18 | Paper |
scientific article; zbMATH DE number 1864588 (Why is no real title available?)
| 2003-02-06 | Paper |
Interactive Markov chains. And the quest for quantified quality
Lecture Notes in Computer Science | 2002-11-07 | Paper |
scientific article; zbMATH DE number 1786475 (Why is no real title available?)
| 2002-08-21 | Paper |
Process algebra for performance evaluation
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1670788 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1670870 (Why is no real title available?)
| 2001-11-11 | Paper |
Construction and verification of performance and reliability models
Bulletin of the European Association for Theoretical Computer Science EATCS | 2001-09-27 | Paper |
scientific article; zbMATH DE number 1538048 (Why is no real title available?)
| 2000-12-03 | Paper |
Automated compositional Markov chain generation for a plain-old telephone system
Science of Computer Programming | 2000-07-10 | Paper |
scientific article; zbMATH DE number 1361121 (Why is no real title available?)
| 2000-04-25 | Paper |
scientific article; zbMATH DE number 1397300 (Why is no real title available?)
| 2000-02-01 | Paper |
scientific article; zbMATH DE number 1324654 (Why is no real title available?)
| 1999-08-17 | Paper |
scientific article; zbMATH DE number 1304995 (Why is no real title available?)
| 1999-06-17 | Paper |
