12 citations · 16 across the 3 of their papers we have counts for
3 papers
cs.LO2014★ 1 cited
Analysis of Probabilistic Basic Parallel Processes
Rémi Bonnet, Stefan Kiefer, Anthony W. Lin
Basic Parallel Processes (BPPs) are a well-known subclass of Petri Nets. They are the simplest common model of concurrent programs that allows unbounded spawning of processes. In t…
cs.LO2013★ 3 cited
Reachability under Contextual Locking
Remi Bonnet, Rohit Chadha, Mahesh Viswanathan +1
The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of the progr…
cs.DM2012★ 12 cited
Model Checking Vector Addition Systems with one zero-test
Rémi Bonnet, Alain FInkel, Jérôme Leroux +1
We design a variation of the Karp-Miller algorithm to compute, in a forward manner, a finite representation of the cover (i.e., the downward closure of the reachability set) of a v…