Checking qualitative liveness properties of replicated systems with stochastic scheduling

DOI10.1007/978-3-030-53291-8_20zbMath1478.68147arXiv2005.03555OpenAlexW3044998661MaRDI QIDQ2226750

Philipp J. Meyer, Martin Helfrich, Antonín Kučera, Javier Esparza, Michael Blondin

Publication date: 9 February 2021

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

zbMATH Keywords

livenessstochastic systemsparameterized verification

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Separators in Continuous Petri Nets ⋮ Separators in continuous Petri nets ⋮ Population protocols: beyond runtime analysis ⋮ The complexity of verifying population protocols ⋮ Computing parameterized invariants of parameterized Petri nets

This page was built for publication: Checking qualitative liveness properties of replicated systems with stochastic scheduling