| Publication | Date of Publication | Type |
|---|
| Reachability in dynamical systems with rounding | 2026-03-23 | Paper |
Linear dynamical systems with weight functions
Nonlinear Analysis. Hybrid Systems | 2026-03-20 | Paper |
| Long-run satisfaction of path properties | 2024-12-19 | Paper |
| Witnessing subsystems for probabilistic systems with low tree width | 2024-12-06 | Paper |
| Entropic risk for turn-based stochastic games | 2024-12-03 | Paper |
Entropic risk for turn-based stochastic games
Information and Computation | 2024-12-03 | Paper |
| Certificates and Witnesses for Multi-Objective Queries in Markov Decision Processes - Artefact - PEVA | 2024-10-30 | Dataset |
Mean-payoff optimization in continuous-time Markov chains with parametric alarms
ACM Transactions on Modeling and Computer Simulation | 2024-09-08 | Paper |
| Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications | 2024-08-13 | Paper |
Positivity-hardness results on Markov decision processes
TheoretiCS | 2024-07-03 | Paper |
| The variance-penalized stochastic shortest path problem | 2024-06-24 | Paper |
| Certificates and Witnesses for Multi-Objective Queries in Markov Decision Processes - QEST 2024 Artefact | 2024-06-24 | Dataset |
| From LTL to unambiguous Büchi automata via disambiguation of alternating automata | 2024-03-14 | Paper |
Foundations of probability-raising causality in Markov decision processes
Logical Methods in Computer Science | 2024-03-11 | Paper |
On probability-raising causality in Markov decision processes
Lecture Notes in Computer Science | 2024-01-23 | Paper |
scientific article; zbMATH DE number 7730630 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-21 | Paper |
| Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking | 2023-08-21 | Paper |
On the foundations of cycles in Bayesian networks
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Operational causality -- necessarily sufficient and sufficiently necessary
Lecture Notes in Computer Science | 2023-07-26 | Paper |
Markov chains and unambiguous automata
Journal of Computer and System Sciences | 2023-06-12 | Paper |
Minimal Witnesses for Probabilistic Timed Automata
1517.682 | 2022-12-22 | Paper |
Delayed-choice semantics for pomset families and message sequence graphs
ModelEd, TestEd, TrustEd | 2022-11-09 | Paper |
Farkas certificates and minimal witnesses for probabilistic reachability constraints
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
Synthesis of Optimal Resilient Control Strategies
Automated Technology for Verification and Analysis | 2022-08-12 | Paper |
Admissibility in Probabilistic Argumentation
Journal of Artificial Intelligence Research | 2022-08-02 | Paper |
Probabilistic causes in Markov chains
(available as arXiv preprint) | 2022-06-22 | Paper |
Determinization and limit-determinization of Emerson-Lei automata
(available as arXiv preprint) | 2022-06-22 | Paper |
From LTL to unambiguous Büchi automata via disambiguation of alternating automata
Formal Methods in System Design | 2022-06-20 | Paper |
Model checking linear-time properties of probabilistic systems
Monographs in Theoretical Computer Science. An EATCS Series | 2022-04-28 | Paper |
Causality-based game solving
(available as arXiv preprint) | 2022-03-25 | Paper |
| The 10,000 facets of MDP model checking | 2022-02-16 | Paper |
| Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination | 2021-12-14 | Paper |
| Modeling role-based systems with exogenous coordination | 2021-05-20 | Paper |
| Probabilistic automata over infinite words: expressiveness, efficiency, and decidability | 2021-01-26 | Paper |
Stochastic shortest paths and weight-bounded properties in Markov decision processes
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| scientific article; zbMATH DE number 7280017 (Why is no real title available?) | 2020-12-02 | Paper |
Maximizing the conditional expected reward for reaching the goal
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
| Tooling, Data and Results for "Components in Probabilistic Systems: Suitable by Construction" | 2020-08-03 | Dataset |
Generic emptiness check for fun and profit
Automated Technology for Verification and Analysis | 2020-07-20 | Paper |
Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
Information and Computation | 2020-05-26 | Paper |
On the probabilistic bisimulation spectrum with silent moves
Acta Informatica | 2020-05-26 | Paper |
Partial and conditional expectations in Markov decision processes with integer weights
(available as arXiv preprint) | 2020-01-28 | Paper |
Farkas certificates and minimal witnesses for probabilistic reachability constraints
(available as arXiv preprint) | 2019-10-23 | Paper |
Mean-payoff optimization in continuous-time Markov chains with parametric alarms
Quantitative Evaluation of Systems | 2019-09-17 | Paper |
Markov chains and unambiguous Büchi automata
Computer Aided Verification | 2019-05-03 | Paper |
Bisimulations, logics, and trace distributions for stochastic systems with rewards
Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week) | 2018-12-06 | Paper |
Model checking probabilistic systems
Handbook of Model Checking | 2018-07-20 | Paper |
Trade-off analysis meets probabilistic model checking
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Weight monitoring with linear temporal logic
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
| Composition of stochastic transition systems based on spans and couplings | 2017-12-19 | Paper |
| Reasoning about cost-utility constraints in probabilistic models | 2017-10-27 | Paper |
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Rare-event verification for stochastic hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control | 2017-05-16 | Paper |
Ratio and weight quantiles
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Quantitative analysis of communication scenarios
Lecture Notes in Computer Science | 2015-09-14 | Paper |
Bisimulation and Simulation Relations for Markov Chains
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
Compositional construction of most general controllers
Acta Informatica | 2015-06-24 | Paper |
Synthesis of Reo circuits from scenario-based specifications
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
Stochastic timed automata
Logical Methods in Computer Science | 2015-01-15 | Paper |
Energy-utility analysis for resilient systems using probabilistic model checking
Application and Theory of Petri Nets and Concurrency | 2014-07-08 | Paper |
Probabilistic model checking for energy-utility analysis
Lecture Notes in Computer Science | 2014-06-02 | Paper |
Synthesis of Reo connectors for strategies and controllers
Fundamenta Informaticae | 2014-05-14 | Paper |
Are good-for-games automata good for probabilistic model checking?
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Probabilistic ω-automata
Journal of the ACM | 2014-02-17 | Paper |
| Symbolic reasoning with weighted and normalized decision diagrams | 2013-10-07 | Paper |
Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata
Algebraic Informatics | 2013-09-20 | Paper |
Model checking for performability
MSCS. Mathematical Structures in Computer Science | 2013-08-26 | Paper |
Computing quantiles in Markov reward models
Lecture Notes in Computer Science | 2013-03-18 | Paper |
| Recurrence and transience for probabilistic automata | 2012-10-24 | Paper |
Stochastic game logic
Acta Informatica | 2012-10-15 | Paper |
Model checking probabilistic systems against pushdown specifications
Information Processing Letters | 2012-07-20 | Paper |
A compositional framework for controller synthesis
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Synthesis of Reo circuits from scenario-based interaction specifications
Science of Computer Programming | 2011-06-07 | Paper |
| Reachability in continuous-time Markov reward decision processes | 2011-03-30 | Paper |
Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications
Formal Methods in System Design | 2010-11-03 | Paper |
Performability assessment by model checking of Markov reward models
Formal Methods in System Design | 2010-05-05 | Paper |
Alternating-time stream logic for multi-agent systems
Science of Computer Programming | 2010-04-29 | Paper |
CONCUR 2003 - Concurrency Theory
Lecture Notes in Computer Science | 2010-03-30 | Paper |
A note on the attractor-property of infinite-state Markov chains
Information Processing Letters | 2009-12-18 | Paper |
Quantitative analysis under fairness constraints
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
Formal Verification for Components and Connectors
Formal Methods for Components and Objects | 2009-10-28 | Paper |
The Effect of Tossing Coins in Omega-Automata
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
| scientific article; zbMATH DE number 5585443 (Why is no real title available?) | 2009-07-23 | Paper |
Symbolic model checking for channel-based component connectors
Science of Computer Programming | 2009-07-15 | Paper |
When Are Timed Automata Determinizable?
Automata, Languages and Programming | 2009-07-14 | Paper |
Probabilistic weak simulation is decidable in polynomial time
Information Processing Letters | 2009-07-09 | Paper |
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
Lecture Notes in Computer Science | 2009-03-11 | Paper |
| Technical informatics. An introduction to computability, complexity and formal languges with 101 examples | 2009-03-03 | Paper |
| scientific article; zbMATH DE number 5522531 (Why is no real title available?) | 2009-03-03 | Paper |
Probabilistic Acceptors for Languages over Infinite Words
Lecture Notes in Computer Science | 2009-02-03 | Paper |
On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
Implementation and Application of Automata | 2008-06-10 | Paper |
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Probabilistic and Topological Semantics for Timed Automata
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
On Decision Problems for Probabilistic Büchi Automata
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Partial Order Reduction for Markov Decision Processes: A Survey
Formal Methods for Components and Objects | 2007-09-11 | Paper |
Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
Theoretical Computer Science | 2007-01-09 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Modeling component connectors in Reo by constraint automata
Science of Computer Programming | 2006-06-30 | Paper |
On the verification of qualitative properties of probabilistic processes under fairness constraints.
Information Processing Letters | 2006-01-17 | Paper |
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
Theoretical Computer Science | 2005-12-06 | Paper |
Foundations of Genetic Algorithms
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Comparative branching-time semantics for Markov chains
Information and Computation | 2005-09-02 | Paper |
Simulating perfect channels with probabilistic lossy channels
Information and Computation | 2005-05-12 | Paper |
| scientific article; zbMATH DE number 2163041 (Why is no real title available?) | 2005-04-29 | 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 1796131 (Why is no real title available?) | 2002-09-04 | Paper |
| scientific article; zbMATH DE number 1759620 (Why is no real title available?) | 2002-06-25 | 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 |
Domain equations for probabilistic processes
MSCS. Mathematical Structures in Computer Science | 2001-08-21 | Paper |
Metric semantics for true concurrent real time
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1512606 (Why is no real title available?) | 2001-06-05 | Paper |
| scientific article; zbMATH DE number 1455625 (Why is no real title available?) | 2000-06-05 | Paper |
| scientific article; zbMATH DE number 1361121 (Why is no real title available?) | 2000-04-25 | Paper |
Deciding bisimilarity and similarity for probabilistic processes.
Journal of Computer and System Sciences | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1324652 (Why is no real title available?) | 1999-08-17 | Paper |
| scientific article; zbMATH DE number 1324653 (Why is no real title available?) | 1999-08-17 | Paper |
| scientific article; zbMATH DE number 1231591 (Why is no real title available?) | 1998-12-21 | Paper |
Trees and semantics
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1113858 (Why is no real title available?) | 1998-03-02 | Paper |
The connection between initial and unique solutions of domain equations in the partial order and metric approach
Formal Aspects of Computing | 1998-02-04 | Paper |
| scientific article; zbMATH DE number 1023018 (Why is no real title available?) | 1997-09-15 | Paper |
| scientific article; zbMATH DE number 1059326 (Why is no real title available?) | 1997-09-10 | Paper |
Metric semantics from partial order semantics
Acta Informatica | 1997-09-09 | Paper |
Denotational linear time semantics and sequential composition
Information Processing Letters | 1997-02-27 | Paper |
Metric completion versus ideal completion
Theoretical Computer Science | 1997-02-27 | Paper |
Denotational semantics in the cpo and metric approach
Theoretical Computer Science | 1995-04-06 | Paper |
The connection between an event structure semantics and an operational semantics for TCSP
Acta Informatica | 1994-05-10 | Paper |
