Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Waldburger, Nicolas"'
We study the reachability problem for one-counter automata in which transitions can carry disequality tests. A disequality test is a guard that prohibits a specified counter value. This reachability problem has been known to be NP-hard and in PSPACE,
Externí odkaz:
http://arxiv.org/abs/2408.11908
Autor:
van Bergerem, Steffen, Guttenberg, Roland, Kiefer, Sandra, Mascle, Corto, Waldburger, Nicolas, Weil-Kennedy, Chana
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 decide whether their initial configuration, that is, the initial distribu
Externí odkaz:
http://arxiv.org/abs/2405.00921
Autor:
Waldburger, Nicolas
We consider the verification of distributed systems composed of an arbitrary number of asynchronous processes. Processes are identical finite-state machines that communicate by reading from and writing to a shared memory. Beyond the standard model wi
Externí odkaz:
http://arxiv.org/abs/2306.17476
We consider the parameterized verification of arbitrarily large networks of agents which communicate by broadcasting and receiving messages. In our model, the broadcast topology is reconfigurable so that a sent message can be received by any set of a
Externí odkaz:
http://arxiv.org/abs/2306.01517
We consider the parameterized verification problem for distributed algorithms where the goal is to develop techniques to prove the correctness of a given algorithm regardless of the number of participating processes. Motivated by an asynchronous bina
Externí odkaz:
http://arxiv.org/abs/2204.11670