5 citations · 10 across the 9 of their papers we have counts for
3 papers · 1 filter
Identifiers in Registers - Describing Network Algorithms with Logic
Benedikt Bollig, Patricia Bouyer, Fabian Reiter
We propose a formal model of distributed computing based on register automata that captures a broad class of synchronous network algorithms. The local memory of each process is rep…
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"
Benedikt Bollig, Marie Fortin, Paul Gastin
Message sequence charts (MSCs) naturally arise as executions of communicating finite-state machines (CFMs), in which finite-state processes exchange messages through unbounded FIFO…
Gossiping in Message-Passing Systems
Benedikt Bollig, Marie Fortin, Paul Gastin
We study the gossip problem in a message-passing environment: When a process receives a message, it has to decide whether the sender has more recent information on other processes…