Symbolic model checking for self-stabilizing algorithms
نویسندگان
چکیده
منابع مشابه
Symbolic Model-Checking of Optimistic Replication Algorithms
The Operational Transformation (OT) approach, used in many collaborative editors, allows a group of users to concurrently update replicas of a shared object and exchange their updates in any order. The basic idea of this approach is to transform any received update operation before its execution on a replica of the object. This transformation aims to ensure the convergence of the different repl...
متن کاملSymbolic Model Checking Algorithms for Temporal-Epistemic Logic
The paper presents ordered binary decision diagram based symbolic model checking algorithms for fragments of a temporal-epistemic logic based on the temporal logic CTL∗ with operators for the knowledge and common knowledge of multiple agents. The knowledge operators are interpreted with respect to several distinct semantics: observational, clock, synchronous perfect recall and asynchronous perf...
متن کاملTowards scalable model checking of self-stabilizing programs
Existing approaches for verifying self-stabilization with a symbolic model checker have relied on the use of weak fairness. We point out that this approach has limited scalability. To overcome this limitation, first, we show that if self-stabilization is possible without fairness then cost of verifying self-stabilization is substantially lower. In fact, we observe from several case studies that...
متن کاملSelf-stabilizing universal algorithms
We prove the existence of a “universal” self-stabilizing algorithm, i.e., an algorithm which allows to stabilize a distributed system to a desired behaviour (as long as an algorithm stabilizing to that behaviour exists). Previous proposals required drastic increases in asymmetry and knowledge in order to work, while our algorithm does not use any additional knowledge, and does not require more ...
متن کاملSelf-stabilizing Algorithms
The study of distributed systems and algorithms helps in understanding the specific features of these systems compared to classic centralized systems: information is local (each element of the system only holds a fraction of the information, and must obtain more by communicating with other elements), and time is local (the elements of the system can run their instructions at different speeds). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2001
ISSN: 1045-9219
DOI: 10.1109/71.899941