• Publications
  • Influence
Limit-Deterministic Büchi Automata for Linear Temporal Logic
tl;dr
We present a direct construction from an LTL formula \(\varphi \) to a limit-deterministic Buchi automaton. Expand
  • 44
  • 10
  • Open Access
Towards Efficient Verification of Population Protocols
tl;dr
We introduce the class WS3 of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. Expand
  • 8
  • 2
  • Open Access
Large Flocks of Small Birds: on the Minimal Size of Population Protocols
tl;dr
Population protocols are a well established model of distributed computation by mobile finite-state agents with very limited storage. Expand
  • 10
  • 1
  • Open Access
Peregrine: A Tool for the Analysis of Population Protocols
tl;dr
We introduce Peregrine, the first tool for the analysis and parameterized verification of population protocols. Expand
  • 9
  • Open Access
Succinct Population Protocols for Presburger Arithmetic
tl;dr
We prove that every formula $\varphi$ of quantifier-free PA with remainder predicates is computable by a leaderless population protocol with $O(\text{poly}(|\varphi|))$ states. Expand
  • 3
  • Open Access
Black Ninjas in the Dark: Formal Analysis of Population Protocols
tl;dr
In this interactive paper, which you should preferably read connected to the Internet, the Black Ninjas introduce you to population protocols, a fundamental model of distributed computation, and to recent work on their automatic verification. Expand
  • 1
  • Open Access
Expressive Power of Broadcast Consensus Protocols
tl;dr
Population protocols are a formal model of computation by identical, anonymous mobile agents interacting in pairs. Expand
  • 1
  • Open Access
The Complexity of Verifying Population Protocols
tl;dr
We study the computational complexity of the correctness problem for population protocols, i.e., whether a given protocol decides a given property. Expand
  • 1
  • Open Access
Expressive Power of Oblivious Consensus Protocols
tl;dr
Population protocols are a formal model of computation by identical, anonymous mobile agents interacting in pairs. Expand
  • 1
  • Open Access
On Semigroups of Two-Dimensional Upper-Triangular Integer Matrices
tl;dr
We analyze algorithmic problems in finitely generated semigroups of two-dimensional upper-triangular integer matrices with determinants +1 and 0 and obtain a number of complexity results. Expand