| Publication | Date of Publication | Type |
|---|
| Introducing divergence for infinite probabilistic models | 2024-10-23 | Paper |
| Analyzing robustness of Angluin's \(L^*\) algorithm in presence of noise | 2024-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6191009 | 2024-02-08 | Paper |
| Coverability and Termination in Recursive Petri Nets | 2024-01-29 | Paper |
| Efficient handling of Phase-type distributions in generalized stochastic Petri nets | 2022-12-09 | Paper |
| Dynamic Recursive Petri Nets | 2022-09-01 | Paper |
| Symbolic reachability graph and partial symmetries | 2022-08-16 | Paper |
| Property-directed verification and robustness certification of recurrent neural networks | 2022-06-22 | Paper |
| A turn-based approach for qualitative time concurrent games | 2022-03-21 | Paper |
| Coverability, Termination, and Finiteness in Recursive Petri Nets | 2022-02-01 | Paper |
| Revisiting reachability in polynomial interrupt timed automata | 2021-12-14 | Paper |
| Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata | 2021-12-14 | Paper |
| Commodification of accelerations for the Karp and Miller construction | 2021-12-09 | Paper |
| Polynomial interrupt timed automata: verification and expressiveness | 2021-04-13 | Paper |
| Guarded autonomous transitions increase conciseness and expressiveness of timed automata | 2021-03-02 | Paper |
| Diagnosis and degradation control for probabilistic systems | 2021-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136302 | 2020-11-25 | Paper |
| Minimal coverability tree construction made complete and efficient | 2020-09-23 | Paper |
| Expressiveness and conciseness of timed automata for the verification of stochastic models | 2020-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111645 | 2020-05-27 | Paper |
| A tale of two diagnoses in probabilistic systems | 2019-12-18 | Paper |
| Approaching the coverability problem continuously | 2019-09-17 | Paper |
| Asynchronous composition of high level Petri Nets: A quantitative approach | 2019-05-02 | Paper |
| Interval iteration algorithm for MDPs and IMDPs | 2018-06-05 | Paper |
| Diagnosis in Infinite-State Probabilistic Systems | 2018-03-21 | Paper |
| Memoryless determinacy of finite parity games: another simple proof | 2018-03-16 | Paper |
| Polynomial interrupt timed automata | 2017-10-27 | Paper |
| The Logical View on Continuous Petri Nets | 2017-10-16 | Paper |
| The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets | 2017-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978532 | 2017-04-25 | Paper |
| Interrupt Timed Automata with Auxiliary Clocks and Parameters* | 2017-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963940 | 2017-02-21 | Paper |
| Specification of Asynchronous Component Systems with Modal I/O-Petri Nets | 2016-11-09 | Paper |
| Optimal constructions for active diagnosis | 2016-09-16 | Paper |
| Complexity analysis of continuous Petri nets | 2016-05-11 | Paper |
| Accurate Approximate Diagnosability of Stochastic Systems | 2016-04-13 | Paper |
| Reachability in MDPs: Refining Convergence of Value Iteration | 2015-10-28 | Paper |
| Parametric Interrupt Timed Automata | 2014-07-07 | Paper |
| Active Diagnosis for Probabilistic Systems | 2014-04-16 | Paper |
| Channel Properties of Asynchronously Composed Petri Nets | 2013-06-28 | Paper |
| Complexity Analysis of Continuous Petri Nets | 2013-06-28 | Paper |
| Ordinal theory for expressiveness of well-structured transition systems | 2013-06-06 | Paper |
| Synthesis and Analysis of Product-form Petri Nets | 2013-04-18 | Paper |
| The expressive power of time Petri nets | 2013-03-27 | Paper |
| Interrupt timed automata: verification and expressiveness | 2012-09-27 | Paper |
| Concurrent Games on VASS with Inhibition | 2012-09-25 | Paper |
| Coupling and Importance Sampling for Statistical Model Checking | 2012-06-29 | Paper |
| Refinement and Asynchronous Composition of Modal Petri Nets | 2012-06-08 | Paper |
| Synthesis and Analysis of Product-Form Petri Nets | 2011-06-29 | Paper |
| Ordinal Theory for Expressiveness of Well Structured Transition Systems | 2011-05-19 | Paper |
| Continuous Petri nets: expressive power and decidability issues | 2010-04-22 | Paper |
| Undecidability Results for Timed Automata with Silent Transitions | 2009-06-30 | Paper |
| A New Approach to the Evaluation of Non Markovian Stochastic Petri Nets | 2009-04-02 | Paper |
| Interrupt Timed Automata | 2009-03-31 | Paper |
| Transactional Reduction of Component Compositions | 2009-03-10 | Paper |
| When are timed automata weakly timed bisimilar to time Petri nets? | 2008-09-16 | Paper |
| Timed Unfoldings for Networks of Timed Automata | 2008-09-04 | Paper |
| On the Computational Power of Timed Differentiable Petri Nets | 2008-07-08 | Paper |
| Continuous Petri Nets: Expressive Power and Decidability Issues | 2008-07-03 | Paper |
| Timed Petri nets and timed automata: On the discriminating power of Zeno sequences | 2008-03-11 | Paper |
| Recursive Petri nets | 2007-12-10 | Paper |
| Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences | 2007-09-11 | Paper |
| Sub-stochastic matrix analysis for bounds computation -- theoretical results | 2006-11-15 | Paper |
| Formal Modeling and Analysis of Timed Systems | 2006-11-14 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-25 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-10 | Paper |
| Formal Techniques for Networked and Distributed Systems - FORTE 2005 | 2006-07-07 | Paper |
| A fault-tolerant communication mechanism for cooperative robots | 2005-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782078 | 2003-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535177 | 2002-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263301 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3776648 | 1987-01-01 | Paper |
