Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking

DOI10.1007/978-3-030-11245-5_19OpenAlexW2906360881MaRDI QIDQ2287101

Laurent Fribourg, Étienne André, Romain Soulat, Jean-Marc Mota

Publication date: 23 January 2020

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

zbMATH Keywords

model checkingdistributed algorithmleader electionparametric timed automataparameterized verificationsaveprover

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

\textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability ⋮ Unnamed Item ⋮ Timed automata relaxation for reachability ⋮ Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints*

This page was built for publication: Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking