Reachability in Networks of Register Protocols under Stochastic Schedulers

DOI10.4230/LIPIcs.ICALP.2016.106zbMath1388.68195arXiv1602.05928OpenAlexW2280864594MaRDI QIDQ4598247

Mickael Randour, Patricia Bouyer, Nicolas Markey, Arnaud Sangnier, Daniel Stan

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1602.05928

zbMATH Keywords

parametrized systemsnetworks of processescut-off propertyalmost-sure reachabilitystochastic scheduler

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Liveness in broadcast networks ⋮ Parameterized analysis of reconfigurable broadcast networks ⋮ Unnamed Item ⋮ Parameterized verification of coverability in infinite state broadcast networks

This page was built for publication: Reachability in Networks of Register Protocols under Stochastic Schedulers