An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP

DOI10.1007/978-3-662-54577-5_2zbMath1452.68026OpenAlexW2593961861MaRDI QIDQ3303889

Jean-Pierre Talpin, Ocan Sankur

Publication date: 5 August 2020

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54577-5_2

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of communicating systems
• A theory of timed automata
• Formal verification of a leader election protocol in process algebra
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• An improved algorithm for decentralized extrema-finding in circular configurations of processes
• Parameterized Verification of Broadcast Networks of Register Automata
• Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
• Formal Methods in Computer-Aided Design

This page was built for publication: An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP