Search

• < Previous
• 1
• Next >

---

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

A. R. Balasubramanian ; Javier Esparza ; Mikhail Raskin.

In rendez-vous protocols an arbitrarily large number of indistinguishable finite-state agents interact in pairs. The cut-off problem asks if there exists a number $B$ such that all initial configurations of the protocol with at least $B$ agents in a given initial state can reach a final&nbsp;[&hellip;]

---

Separators in Continuous Petri Nets

Michael Blondin ; Javier Esparza.

Leroux has proved that unreachability in Petri nets can be witnessed by a Presburger separator, i.e. if a marking $\vec{m}_\text{src}$ cannot reach a marking $\vec{m}_\text{tgt}$, then there is a formula $\varphi$ of Presburger arithmetic such that: $\varphi(\vec{m}_\text{src})$ holds; $\varphi$ is&nbsp;[&hellip;]

---