| Publication | Date of Publication | Type |
|---|
| On robustness for the Skolem and positivity problems | 2024-04-23 | Paper |
| Resilience of Timed Systems | 2024-02-05 | Paper |
| Succinct Population Protocols for Presburger Arithmetic | 2023-02-07 | Paper |
| Classification among Hidden Markov Models | 2023-02-03 | Paper |
| Global PAC bounds for learning discrete time Markov chains | 2021-02-09 | Paper |
| Distribution-based objectives for Markov Decision Processes | 2021-01-20 | Paper |
| Timed negotiations | 2020-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111624 | 2020-05-27 | Paper |
| A Look-Ahead Simulation Algorithm for DBN Models of Biochemical Pathways | 2019-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5227518 | 2019-08-06 | Paper |
| Symbolically quantifying response time in stochastic models using moments and semirings | 2018-07-17 | Paper |
| Qualitative Determinacy and Decidability of Stochastic Games with Signals | 2018-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601857 | 2018-01-24 | Paper |
| Approximate Verification of the Symbolic Dynamics of Markov Chains | 2017-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963915 | 2017-02-21 | Paper |
| Decidable Classes of Unbounded Petri Nets with Time and Urgency | 2016-10-04 | Paper |
| Knowledge = Observation + Memory + Computation | 2015-10-01 | Paper |
| Approximate Verification of the Symbolic Dynamics of Markov Chains | 2015-08-14 | Paper |
| Diagnosis from scenarios | 2014-12-12 | Paper |
| Privacy preserving minimal observability for composite transactional services | 2014-12-12 | Paper |
| Asynchronous Games over Tree Architectures | 2013-08-07 | Paper |
| Symbolically Bounding the Drift in Time-Constrained MSC Graphs | 2012-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2911642 | 2012-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908878 | 2012-08-29 | Paper |
| Regular set of representatives for time-constrained MSC graphs | 2012-07-25 | Paper |
| Quasi-static scheduling of communicating tasks | 2010-10-07 | Paper |
| Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata | 2010-09-07 | Paper |
| QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS | 2010-04-22 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| On commutativity based edge lean search | 2010-03-15 | Paper |
| Causal message sequence charts | 2009-09-29 | Paper |
| Grey-Box Checking | 2009-03-11 | Paper |
| Quasi-Static Scheduling of Communicating Tasks | 2008-11-25 | Paper |
| Tree Pattern Rewriting Systems | 2008-11-20 | Paper |
| Causal Message Sequence Charts | 2008-09-18 | Paper |
| Quantifying the Discord: Order Discrepancies in Message Sequence Charts | 2008-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504343 | 2008-06-11 | Paper |
| Pattern matching and membership for hierarchical message sequence charts | 2008-06-06 | Paper |
| Products of Message Sequence Charts | 2008-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431917 | 2008-01-02 | Paper |
| On Commutativity Based Edge Lean Search | 2007-11-28 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| Constructing Exponential-Size Deterministic Zielonka Automata | 2007-09-11 | Paper |
| Detecting Races in Ensembles of Message Sequence Charts | 2007-09-03 | Paper |
| CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
| A Kleene theorem and model checking algorithms for existentially bounded communicating automata | 2006-07-12 | Paper |
| Infinite-state high-level MSCs: model-checking and realizability | 2006-06-30 | Paper |
| Lectures on Concurrency and Petri Nets | 2005-12-23 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044337 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737197 | 2004-08-11 | Paper |
