2 citations · 3 across the 10 of their papers we have counts for
13 papers
Runtime Verification of Interactions Using Automata
Chana Weil-Kennedy, Darine Rammal, Christophe Gaston +1
Runtime verification consists in observing and collecting the execution traces of a system and checking them against a specification, with the objective of raising an error when a…
Temporal Hyperproperties for Population Protocols
Nicolas Waldburger, Chana Weil-Kennedy, Pierre Ganty +1
Hyperproperties are properties over sets of traces (or runs) of a system, as opposed to properties of just one trace. They were introduced in 2010 and have been much studied since,…
Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
Paul Eichler, Swen Jacobs, Chana Weil-Kennedy
We introduce a new framework for verifying systems with a parametric number of concurrently running processes. The systems we consider are well-structured with respect to a specifi…
Verification of Population Protocols with Unordered Data
Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer +3
Population protocols are a well-studied model of distributed computation in which a group of anonymous finite-state agents communicates via pairwise interactions. Together they dec…
A Uniform Framework for Language Inclusion Problems
Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy
We present a uniform approach for solving language inclusion problems. Our approach relies on a least fixpoint characterization and a quasiorder to compare words of the "smaller" l…
Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version)
A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy
Reconfigurable broadcast networks (RBN) are a model of distributed computation in which agents can broadcast messages to other agents using some underlying communication topology w…
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent
A. R. Balasubramanian, Chana Weil-Kennedy
We show the equivalence of two distributed computing models, namely reconfigurable broadcast networks (RBN) and asynchronous shared-memory systems (ASMS), that were introduced inde…
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version)
A. R. Balasubramanian, Chana Weil-Kennedy
We show the equivalence of two distributed computing models, namely reconfigurable broadcast networks (RBN) and asynchronous shared-memory systems (ASMS), that were introduced inde…
Efficient Restrictions of Immediate Observation Petri Nets
Michael Raskin, Chana Weil-Kennedy
In a previous paper we introduced immediate observation Petri nets, a subclass of Petri nets with application domains in distributed protocols (population protocols) and theoretica…
Flatness and Complexity of Immediate Observation Petri Nets
Mikhail Raskin, Chana Weil-Kennedy, Javier Esparza
In a previous paper we introduced immediate observation (IO) Petri nets, a class of interest in the study of population protocols and enzymatic chemical networks. In the first part…
The Complexity of Verifying Population Protocols
Javier Esparza, Stefan Jaax, Mikhail Raskin +1
Population protocols [Angluin et al., PODC, 2004] are a model of distributed computation in which indistinguishable, finite-state agents interact in pairs to decide if their initia…
Parameterized Analysis of Immediate Observation Petri Nets
Javier Esparza, Mikhail Raskin, Chana Weil-Kennedy
We introduce immediate observation Petri nets, a class of interest in the study of population protocols (a model of distributed computation), and enzymatic chemical networks. In th…
Verification of Immediate Observation Population Protocols
Javier Esparza, Pierre Ganty, Rupak Majumdar +1
Population protocols (Angluin et al., PODC, 2004) are a formal model of sensor networks consisting of identical mobile devices. Two devices can interact and thereby change their st…