| 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 |
| What's hard about Boolean functional synthesis? | 2023-05-26 | Paper |
| Near-Optimal Complexity Bounds for Fragments of the Skolem Problem | 2023-02-07 | Paper |
| Classification among Hidden Markov Models | 2023-02-03 | Paper |
| On eventual non-negativity and positivity for the weighted sum of powers of matrices | 2022-12-07 | Paper |
| Revisiting Underapproximate Reachability for Multipushdown Systems | 2022-10-13 | Paper |
| Fast zone-based algorithms for reachability in pushdown timed automata | 2022-03-25 | Paper |
| Boolean functional synthesis: hardness and practical algorithms | 2021-08-30 | Paper |
| Sparse Hashing for Scalable Approximate Model Counting | 2021-01-21 | Paper |
| Distribution-based objectives for Markov Decision Processes | 2021-01-20 | Paper |
| Timed negotiations | 2020-09-23 | Paper |
| Towards Parallel Boolean Functional Synthesis | 2020-08-05 | Paper |
| Towards an Efficient Tree Automata based technique for Timed Systems | 2020-05-27 | Paper |
| On Petri Nets with Hierarchical Special Arcs | 2020-05-27 | Paper |
| Complexity of Restricted Variants of Skolem and Related Problems | 2020-05-26 | Paper |
| Combining free choice and time in Petri nets | 2020-01-31 | Paper |
| Continuous reachability for unordered data Petri nets is in PTime | 2020-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643961 | 2018-05-30 | Paper |
| Stochastic Timed Games Revisited | 2018-03-21 | Paper |
| Analyzing Timed Systems Using Tree Automata | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601857 | 2018-01-24 | Paper |
| Approximate Verification of the Symbolic Dynamics of Markov Chains | 2017-05-16 | Paper |
| Robustness of Time Petri Nets under Guard Enlargement | 2017-03-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 |
| Approximate Verification of the Symbolic Dynamics of Markov Chains | 2015-08-14 | Paper |
| Checking conformance for time-constrained scenario-based specifications | 2015-07-24 | Paper |
| Reachability problems for Markov chains | 2014-12-09 | Paper |
| Event clock message passing automata: a logical characterization and an emptiness checking algorithm | 2014-06-30 | Paper |
| Distributed Timed Automata with Independently Evolving Clocks | 2014-05-14 | Paper |
| Robustness of Time Petri Nets under Guard Enlargement | 2013-01-07 | Paper |
| Robustness of Time Petri Nets under Architectural Constraints | 2012-11-21 | Paper |
| Symbolically Bounding the Drift in Time-Constrained MSC Graphs | 2012-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908850 | 2012-08-29 | Paper |
| Regular set of representatives for time-constrained MSC graphs | 2012-07-25 | Paper |
| Distributed Timed Automata with Independently Evolving Clocks | 2008-11-25 | Paper |
| Checking Coverage for Infinite Collections of Timed Scenarios | 2008-09-18 | Paper |
| Automata and Logics for Timed Message Sequence Charts | 2008-04-24 | Paper |
