| Publication | Date of Publication | Type |
|---|
| Kaki: efficient concurrent update synthesis for SDN | 2024-09-27 | Paper |
| Optimal control strategies for stormwater detention ponds | 2024-07-30 | Paper |
| Model verification through dependency graphs | 2024-02-23 | Paper |
| Abstract Dependency Graphs and Their Application to Model Checking | 2023-11-24 | Paper |
| Elimination of detached regions in dependency graph verification | 2023-10-16 | Paper |
| Simulation relations and applications in formal methods | 2023-08-10 | Paper |
| Start pruning when time gets urgent: partial order reduction for timed systems | 2023-05-26 | Paper |
| Partial order reduction for reachability games | 2023-02-03 | Paper |
| Urgent Partial Order Reduction for Extended Timed Automata | 2022-12-22 | Paper |
| Synthesis for Multi-weighted Games with Branching-Time Winning Conditions | 2022-09-01 | Paper |
| On-the-Fly Synthesis for Strictly Alternating Games | 2022-09-01 | Paper |
| Kaki: concurrent update synthesis for regular policies via Petri games | 2022-08-19 | Paper |
| Automata-driven partial order reduction and guided search for LTL model checking | 2022-07-08 | Paper |
| Faster pushdown reachability analysis with applications in network verification | 2022-06-22 | Paper |
| Stubborn set reduction for timed reachability and safety games | 2022-03-24 | Paper |
| Verification of multiplayer stochastic games via abstract dependency graphs | 2022-03-23 | Paper |
| Automatic synthesis of transiently correct network updates via Petri games | 2022-03-21 | Paper |
| Resilient capacity-aware routing | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5856425 | 2021-03-26 | Paper |
| Simplification of CTL formulae for efficient model checking of Petri nets | 2019-12-18 | Paper |
| Model checking and synthesis for branching multi-weighted logics | 2019-06-20 | Paper |
| Stubborn versus structural reductions for Petri nets | 2018-12-19 | Paper |
| A Distributed Fixed-Point Algorithm for Extended Dependency Graphs* | 2018-10-02 | Paper |
| Extended dependency graphs and efficient distributed fixed-point computation | 2018-08-20 | Paper |
| Distributed computation of fixed points on dependency graphs | 2018-08-16 | Paper |
| PTrie: data structure for compressing and storing sets via prefix sharing | 2017-11-03 | Paper |
| Polynomial Time Decidability of Weighted Synchronization under Partial Observability | 2017-09-12 | Paper |
| Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization | 2016-06-22 | Paper |
| Soundness of timed-arc workflow nets in discrete and continuous-time semantics | 2016-05-02 | Paper |
| Language Emptiness of Continuous-Time Parametric Timed Automata | 2015-11-04 | Paper |
| Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets | 2015-08-06 | Paper |
| Refinement checking on parametric modal transition systems | 2015-04-16 | Paper |
| Synchronizing Strategies under Partial Observability | 2014-09-15 | Paper |
| Soundness of Timed-Arc Workflow Nets | 2014-07-08 | Paper |
| TCTL-preserving translations from timed-arc Petri nets to networks of timed automata | 2014-06-10 | Paper |
| The algorithmics of bisimilarity | 2014-04-25 | Paper |
| Completeness results for undecidable bisimilarity problems | 2013-09-09 | Paper |
| Complexity of Weak Bisimilarity and Regularity for BPA and BPP | 2013-04-26 | Paper |
| EXPTIME-completeness of thorough refinement on modal transition systems | 2012-11-27 | Paper |
| Extending modal transition systems with structured labels | 2012-09-06 | Paper |
| Modal transition systems with weight intervals | 2012-08-14 | Paper |
| TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets | 2012-06-29 | Paper |
| Dual-Priced Modal Transition Systems with Time Durations | 2012-06-15 | Paper |
| Energy Games in Multiweighted Automata | 2012-01-06 | Paper |
| Parametric Modal Transition Systems | 2011-10-07 | Paper |
| Verification of Timed-Arc Petri Nets | 2011-02-15 | Paper |
| On determinism in modal transition systems | 2009-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395948 | 2009-09-15 | Paper |
| Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete | 2009-08-20 | Paper |
| Beyond Language Equivalence on Visibly Pushdown Automata | 2009-04-29 | Paper |
| Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains | 2009-03-31 | Paper |
| Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation | 2009-03-12 | Paper |
| Undecidability of bisimilarity by defender's forcing | 2008-12-21 | Paper |
| Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets | 2008-12-02 | Paper |
| Infinite Runs in Weighted Timed Automata with Energy Constraints | 2008-12-02 | Paper |
| Height-Deterministic Pushdown Automata | 2008-09-17 | Paper |
| Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols | 2008-09-04 | Paper |
| Reactive Systems | 2007-10-04 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| Decidability issues for extended ping-pong protocols | 2007-01-30 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Applications and Theory of Petri Nets 2005 | 2005-12-14 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673429 | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665738 | 2005-04-11 | Paper |
| On the computational complexity of bisimulation, redux | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736869 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737202 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738239 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474226 | 2004-08-04 | Paper |
| Complexity of weak bisimilarity and regularity for BPA and BPP | 2004-03-30 | Paper |
| Strong bisimilarity of simple process algebras: Complexity lower bounds | 2004-03-11 | Paper |
| Undecidability of domino games and hhp-bisimilarity. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412112 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484512 | 2003-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791269 | 2003-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536381 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535170 | 2002-06-13 | Paper |
| Basic process algebra with deadlocking states | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496248 | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218112 | 1998-11-11 | Paper |
