Search

• < Previous
• 1
• Next >

---

Model Checking Probabilistic Pushdown Automata

Javier Esparza ; Antonin Kucera ; Richard Mayr.

We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model&nbsp;[&hellip;]

---

Soundness in negotiations

Javier Esparza ; Denis Kuperberg ; Anca Muscholl ; Igor Walukiewicz.

Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized choice as communication primitive. Well-designed negotiations must be sound, meaning that, whatever its current state, the negotiation can still&nbsp;[&hellip;]

---

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;]

---