52 citations · 267 across the 47 of their papers we have counts for
5 papers · 1 filter
Distributed Markov Chains
Sumit Kumar Jha, Madhavan Mukund, Ratul Saha +1
The formal verification of large probabilistic models is important and challenging. Exploiting the concurrency that is often present is one way to address this problem. Here we stu…
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version)
Javier Esparza
We survey some results on the automatic verification of parameterized programs without identities. These are systems composed of arbitrarily many components, all of them running ex…
Negotiation Games (with abstract)
Javier Esparza, Philipp Hoffmann
Negotiations, a model of concurrency with multi party negotiation as primitive, have been recently introduced in arXiv:1307.2145, arXiv:1403.4958. We initiate the study of games fo…
On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations
Javier Esparza, Jörg Desel
We continue our study of negotations, a concurrency model with multiparty negotiation as primitive. In a previous paper (arXiv:13072145) we have provided a correct and complete set…
From LTL to Deterministic Automata: A Safraless Compositional Approach
Javier Esparza, Jan Křetínský
We present a new algorithm to construct a deterministic Rabin automaton for an LTL formula . The automaton is the product of a master automaton and an array of slave automata, o…