| Publication | Date of Publication | Type |
|---|
| Lower bounds on the state complexity of population protocols | 2024-03-26 | Paper |
| Decision Power of Weak Asynchronous Models of Distributed Computing | 2024-03-26 | Paper |
| Separators in Continuous Petri Nets | 2024-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187013 | 2024-02-05 | Paper |
| Parameterized Analysis of Immediate Observation Petri Nets | 2024-01-29 | Paper |
| Separators in continuous Petri nets | 2024-01-23 | Paper |
| The asynchronous committee meeting problem | 2024-01-05 | Paper |
| Fast and succinct population protocols for Presburger arithmetic | 2024-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6091631 | 2023-11-24 | Paper |
| Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy | 2023-10-23 | Paper |
| Lower bounds on the state complexity of population protocols | 2023-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6176097 | 2023-08-21 | Paper |
| A simple rewrite system for the normalization of linear temporal logic | 2023-08-10 | Paper |
| Reachability analysis of pushdown automata: Application to model-checking | 2023-05-17 | Paper |
| Population protocols: beyond runtime analysis | 2023-03-31 | Paper |
| Succinct Population Protocols for Presburger Arithmetic | 2023-02-07 | Paper |
| Expressive Power of Broadcast Consensus Protocols | 2023-02-03 | Paper |
| Advances in quantitative analysis of free-choice workflow Petri nets (invited talk) | 2023-02-03 | Paper |
| Complexity of Verification and Synthesis of Threshold Automata | 2022-12-22 | Paper |
| Petri nets, commutative context-free grammars, and basic parallel processes | 2022-12-09 | Paper |
| A Unified Translation of Linear Temporal Logic to ω-Automata | 2022-12-08 | Paper |
| Model checking using net unfoldings | 2022-11-02 | Paper |
| Computing Parameterized Invariants of Parameterized Petri Nets | 2022-10-31 | Paper |
| Structural Invariants for the Verification of Systems with Parameterized Architectures | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089274 | 2022-07-18 | Paper |
| Flatness and Complexity of Immediate Observation Petri Nets | 2022-07-18 | Paper |
| Back to the future: a fresh look at linear temporal logic | 2022-03-22 | Paper |
| Computing parameterized invariants of parameterized Petri nets | 2022-03-21 | Paper |
| Towards efficient verification of population protocols | 2021-12-08 | Paper |
| Verification | 2021-11-12 | Paper |
| Finding cut-offs in leaderless rendez-vous protocols is easy | 2021-10-18 | Paper |
| Verification of Immediate Observation Population Protocols | 2021-08-04 | Paper |
| Automatic Analysis of Expected Termination Time for Population Protocols | 2021-08-04 | Paper |
| The complexity of verifying population protocols | 2021-05-17 | Paper |
| Checking qualitative liveness properties of replicated systems with stochastic scheduling | 2021-02-09 | Paper |
| An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata | 2021-01-21 | Paper |
| Black Ninjas in the Dark | 2021-01-20 | Paper |
| One Theorem to Rule Them All | 2021-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144691 | 2021-01-19 | Paper |
| From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304110 | 2020-08-05 | Paper |
| Computing the concurrency threshold of sound free-choice workflow nets | 2019-09-16 | Paper |
| Limit-Deterministic Büchi Automata for Linear Temporal Logic | 2019-05-03 | Paper |
| Negotiation as concurrency primitive | 2019-03-14 | Paper |
| Parameterized Verification of Asynchronous Shared-Memory Systems | 2018-08-02 | Paper |
| Model Checking Procedural Programs | 2018-07-20 | Paper |
| Model Checking Population Protocols | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608664 | 2018-03-21 | Paper |
| Model checking parameterized asynchronous shared-memory systems | 2018-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3130542 | 2018-01-23 | Paper |
| Polynomial analysis algorithms for free choice probabilistic workflow nets | 2018-01-11 | Paper |
| Towards efficient verification of population protocols | 2017-10-11 | Paper |
| Verification of Population Protocols | 2017-09-12 | Paper |
| Advances in parameterized verification of population protocols | 2017-08-22 | Paper |
| From LTL to deterministic automata. A safraless compositional approach | 2017-07-26 | Paper |
| Negotiations and Petri Nets | 2017-06-20 | Paper |
| A Perfect Model for Bounded Verification | 2017-05-16 | Paper |
| Model checking parameterized asynchronous shared-memory systems | 2017-05-15 | Paper |
| Verification of population protocols | 2017-04-20 | Paper |
| Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk). | 2017-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963916 | 2017-02-21 | Paper |
| Existence of home states in Petri nets is decidable | 2016-04-06 | Paper |
| FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings | 2016-02-17 | Paper |
| A generic approach to the static analysis of concurrent programs with procedures | 2015-09-11 | Paper |
| Negotiation Programs | 2015-08-27 | Paper |
| Efficient algorithms for pre* and post* on interprocedural parallel flow graphs | 2015-03-17 | Paper |
| Distributed Markov Chains | 2015-02-04 | Paper |
| Message-Passing Algorithms for the Verification of Distributed Protocols | 2015-01-13 | Paper |
| An SMT-Based Approach to Coverability Analysis | 2014-09-29 | Paper |
| FPsolve: A Generic Solver for Fixpoint Equations over Semirings | 2014-09-26 | Paper |
| Deterministic Negotiations: Concurrency for Free | 2014-09-15 | Paper |
| A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars | 2014-08-13 | Paper |
| Analyzing probabilistic pushdown automata | 2014-06-30 | Paper |
| On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations | 2014-04-16 | Paper |
| Complexity of pattern-based verification for multithreaded programs | 2014-04-10 | Paper |
| A Brief History of Strahler Numbers | 2014-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2851071 | 2013-10-02 | Paper |
| Negotiation as concurrency primitive | 2013-08-12 | Paper |
| Parikh's theorem: a simple and direct automaton construction | 2013-03-28 | Paper |
| Convergence Thresholds of Newton's Method for Monotone Polynomial Equations | 2013-03-19 | Paper |
| Three Case Studies on Verification of Infinite-State Systems | 2013-02-26 | Paper |
| Rabinizer: Small Deterministic Automata for LTL(F,G) | 2012-11-21 | Paper |
| On the memory consumption of probabilistic pushdown automata | 2012-10-24 | Paper |
| Space-efficient scheduling of stochastically generated tasks | 2012-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3225714 | 2012-03-22 | Paper |
| COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS | 2012-01-23 | Paper |
| Solving Fixed-Point Equations by Derivation Tree Analysis | 2011-09-02 | Paper |
| Derivation tree analysis for accelerated fixed-point computation | 2011-07-07 | Paper |
| Newtonian program analysis | 2011-05-16 | Paper |
| Computing the Least Fixed Point of Positive Polynomial Systems | 2011-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3060977 | 2010-12-13 | Paper |
| Verification of Graph Transformation Systems with Context-Free Specifications | 2010-10-04 | Paper |
| Space-Efficient Scheduling of Stochastically Generated Tasks | 2010-09-07 | Paper |
| Learning Workflow Petri Nets | 2010-06-22 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| Separability in Conflict-Free Petri Nets | 2010-02-02 | Paper |
| Stochastic Process Creation | 2009-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5190774 | 2009-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3620428 | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549616 | 2009-01-05 | Paper |
| Derivation Tree Analysis for Accelerated Fixed-Point Computation | 2008-10-30 | Paper |
| Rewriting Models of Boolean Programs | 2008-09-25 | Paper |
| Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains | 2008-09-04 | Paper |
| Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols | 2008-09-04 | Paper |
| Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations | 2008-08-28 | Paper |
| Newton’s Method for ω-Continuous Semirings | 2008-08-19 | Paper |
| An efficient automata approach to some problems on context-free grammars. | 2008-06-27 | Paper |
| Unfoldings: A partial-order approach to model checking. | 2008-04-23 | Paper |
| An Extension of Newton’s Method to ω-Continuous Semirings | 2007-11-28 | Paper |
| Model Checking Probabilistic Pushdown Automata | 2007-10-11 | Paper |
| On Fixed Point Equations over Commutative Semirings | 2007-09-03 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-05-02 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Static Analysis | 2006-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5714447 | 2006-01-02 | 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 |
| A Generic Approach to the Static Analysis of Concurrent Programs with Procedures | 2005-10-19 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Model checking LTL with regular valuations for pushdown systems | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4824480 | 2004-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818827 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818859 | 2004-09-24 | Paper |
| A Logical Viewpoint on Process-algebraic Quotients | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738300 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452049 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417918 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411946 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787241 | 2003-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536398 | 2002-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551162 | 2002-09-04 | Paper |
| An improvement of McMillan's unfolding algorithm | 2002-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532082 | 2002-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531752 | 2002-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2775861 | 2002-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754086 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754166 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729233 | 2001-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790409 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270079 | 2000-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954445 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945217 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945247 | 2000-03-23 | Paper |
| Petri nets and regular processes | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270050 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268457 | 1999-10-31 | Paper |
| Zeros of the Whittaker function associated to Coulomb waves | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222875 | 1998-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4371017 | 1998-09-20 | Paper |
| Reachability in live and safe free-choice Petri nets is NP-complete | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247290 | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355677 | 1997-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353915 | 1997-09-10 | Paper |
| Decidability of model checking for infinite-state concurrent systems | 1997-06-05 | Paper |
| Complexity results for 1-safe nets | 1997-02-28 | Paper |
| Trapping mutual exclusion in the box calculus | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858945 | 1995-12-20 | Paper |
| Free Choice Petri Nets | 1995-11-23 | Paper |
| Shortest paths in reachability graphs | 1995-10-25 | Paper |
| Model checking using net unfoldings | 1995-04-10 | Paper |
| Reduction and synthesis of live and bounded free choice Petri nets | 1994-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4289279 | 1994-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281515 | 1994-04-07 | Paper |
| Reachability in cyclic extended free-choice systems | 1993-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4202931 | 1993-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035686 | 1993-05-18 | Paper |
| A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming | 1993-01-16 | Paper |
| Traps characterize home states in free choice systems | 1992-09-27 | Paper |
| Zeros of the Hankel function of real order out of the principal Riemann sheet | 1992-06-28 | Paper |
