52 citations · 267 across the 47 of their papers we have counts for
9 papers · 1 filter
A Uniform Framework for Problems on Context-Free Grammars
Javier Esparza, Peter Rossmanith, Stefan Schwoon
In a paper published in Information Processing Letters in 2000, Bouajjani et al. presented an automata-based approach to a number of elementary problems on context-free grammars. T…
Black-box Testing Liveness Properties of Partially Observable Stochastic Systems
Javier Esparza, Vincent Grande
We study black-box testing for stochastic systems and arbitrary -regular specifications, explicitly including liveness properties. We are given a finite-state probabilistic syst…
Geometry of Reachability sets of Vector Addition Systems
Roland Guttenberg, Mikhail Raskin, Javier Esparza
Vector Addition Systems (VAS), aka Petri nets, are a popular model of concurrency. The reachability set of a VAS is the set of configurations reachable from the initial configurati…
Decision Power of Weak Asynchronous Models of Distributed Computing
Philipp Czerner, Roland Guttenberg, Martin Helfrich +1
Esparza and Reiter have recently conducted a systematic comparative study of models of distributed computing consisting of a network of identical finite-state automata that coopera…
Online Monitoring -Regular Properties in Unknown Markov Chains
Javier Esparza, Stefan Kiefer, Jan Kretinsky +1
We study runtime monitoring of -regular properties. We consider a simple setting in which a run of an unknown finite-state Markov chain is monitored against a fixed…
A Classification of Weak Asynchronous Models of Distributed Computing
Javier Esparza, Fabian Reiter
We conduct a systematic study of asynchronous models of distributed computing consisting of identical finite-state devices that cooperate in a network to decide if the network sati…
Soundness in negotiations
Javier Esparza, Denis Kuperberg, Anca Muscholl +1
Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized choice as communication…
A Perfect Model for Bounded Verification
Javier Esparza, Pierre Ganty, Rupak Majumdar
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic…
Parikh's Theorem: A simple and direct automaton construction
Javier Esparza, Pierre Ganty, Stefan Kiefer +1
Parikh's theorem states that the Parikh image of a context-free language is semilinear or, equivalently, that every context-free language has the same Parikh image as some regular…