| Towards efficient verification of population protocols | 0 | 0.34 | 2021 |
| Directed Reachability for Infinite-State Systems. | 0 | 0.34 | 2021 |
| The Complexity Of Reachability In Affine Vector Addition Systems With States | 0 | 0.34 | 2021 |
| The Reachability Problem for Two-Dimensional Vector Addition Systems with States | 0 | 0.34 | 2021 |
| Continuous One-Counter Automata | 0 | 0.34 | 2021 |
| The ABCs of petri net reachability relaxations | 0 | 0.34 | 2020 |
| The Complexity of Reachability in Affine Vector Addition Systems with States | 0 | 0.34 | 2020 |
| Forward Analysis for WSTS, Part III: Karp-Miller Trees. | 0 | 0.34 | 2020 |
| Succinct Population Protocols for Presburger Arithmetic. | 0 | 0.34 | 2020 |
| Expressive Power of Oblivious Consensus Protocols. | 0 | 0.34 | 2019 |
| Expressive Power of Broadcast Consensus Protocols. | 0 | 0.34 | 2019 |
| Affine Extensions Of Integer Vector Addition Systems With States | 0 | 0.34 | 2018 |
| Black Ninjas in the Dark: Formal Analysis of Population Protocols. | 0 | 0.34 | 2018 |
| Peregrine: A Tool For The Analysis Of Population Protocols | 1 | 0.36 | 2018 |
| Handling infinitely branching well-structured transition systems. | 0 | 0.34 | 2018 |
| Automatic Analysis of Expected Termination Time for Population Protocols. | 0 | 0.34 | 2018 |
| Large Flocks of Small Birds: On the Minimal Size of Population Protocols. | 1 | 0.36 | 2018 |
| Well Behaved Transition Systems. | 0 | 0.34 | 2017 |
| Towards Efficient Verification of Population Protocols. | 3 | 0.40 | 2017 |
| Forward Analysis for WSTS, Part III: Karp-Miller Trees. | 0 | 0.34 | 2017 |
| The Logical View on Continuous Petri Nets | 1 | 0.35 | 2017 |
| Approaching the Coverability Problem Continuously | 5 | 0.47 | 2015 |
| Handling Infinitely Branching WSTS. | 3 | 0.41 | 2014 |
| Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. | 12 | 0.62 | 2014 |
| The Complexity of Intersecting Finite Automata Having Few Final States. | 1 | 0.36 | 2012 |
