research
∙
05/19/2023
Making = Practical: Efficient Interactive Protocols for BDD Algorithms
We show that interactive protocols between a prover and a verifier, a we...
share
research
∙
04/18/2023
A Simple Rewrite System for the Normalization of Linear Temporal Logic
In the mid 80s, Lichtenstein, Pnueli, and Zuck showed that every formula...
research
∙
09/06/2022
Separators in Continuous Petri Nets
Leroux has proved that unreachability in Petri nets can be witnessed by ...
research
∙
05/06/2022
Regular Model Checking Upside-Down: An Invariant-Based Approach
Regular model checking is a well-established technique for the verificat...
research
∙
02/23/2022
Fast and Succinct Population Protocols for Presburger Arithmetic
In their 2006 seminal paper in Distributed Computing, Angluin et al. pre...
research
∙
08/30/2021
Population Protocols: Beyond Runtime Analysis
I survey our recent work on the verification of population protocols and...
research
∙
08/20/2021
Abduction of trap invariants in parameterized systems
In a previous paper we have presented a CEGAR approach for the verificat...
research
∙
03/18/2021
Computing Parameterized Invariants of Parameterized Petri Nets
A fundamental advantage of Petri net models is the possibility to automa...
research
∙
02/23/2021
Lower Bounds on the State Complexity of Population Protocols
Population protocols are a model of computation in which an arbitrary nu...
research
∙
10/19/2020
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
In rendez-vous protocols an arbitrarily large number of indistinguishabl...
research
∙
07/15/2020
Peregrine 2.0: Explaining Correctness of Population Protocols through Stage Graphs
We present a new version of Peregrine, the tool for the analysis and par...
research
∙
07/13/2020
Complexity of Verification and Synthesis of Threshold Automata
Threshold automata are a formalism for modeling and analyzing fault-tole...
research
∙
07/07/2020
A Classification of Weak Asynchronous Models of Distributed Computing
We conduct a systematic study of asynchronous models of distributed comp...
research
∙
05/07/2020
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling
We present a sound and complete method for the verification of qualitati...
research
∙
05/01/2020
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata
In the mid 80s, Lichtenstein, Pnueli, and Zuck proved a classical theore...
research
∙
02/18/2020
Structural Invariants for the Verification of Systems with Parameterized Architectures
We consider parameterized concurrent systems consisting of a finite but ...
research
∙
12/13/2019
The Complexity of Verifying Population Protocols
Population protocols [Angluin et al., PODC, 2004] are a model of distrib...
research
∙
10/10/2019
Succinct Population Protocols for Presburger Arithmetic
Angluin et al. proved that population protocols compute exactly the pred...
research
∙
02/08/2019
Parameterized Analysis of Immediate Observation Petri Nets
We introduce immediate observation Petri nets, a class of interest in th...
research
∙
02/05/2019
Expressive Power of Oblivious Consensus Protocols
Population protocols are a formal model of computation by identical, ano...
research
∙
11/16/2018
Computing the Expected Execution Time of Probabilistic Workflow Nets
Free-Choice Workflow Petri nets, also known as Workflow Graphs, are a po...
research
∙
07/16/2018
Verification of Immediate Observation Population Protocols
Population protocols (Angluin et al., PODC, 2004) are a formal model of ...
research
∙
07/01/2018
Automatic Analysis of Expected Termination Time for Population Protocols
Population protocols are a formal model of sensor networks consisting of...
research
∙
05/02/2018
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata
We present a unified translation of LTL formulas into deterministic Rabi...
research
∙
02/22/2018
Computing the concurrency threshold of sound free-choice workflow nets
Workflow graphs extend classical flow charts with concurrent fork and jo...
research
∙
01/02/2018
