Results 21 to 30 of about 61,865 (169)
Quantum Doeblin Coefficients: Interpretations and Applications [PDF]
QuantumIn classical information theory, the Doeblin coefficient of a classical channel provides an efficiently computable upper bound on the total-variation contraction coefficient of the channel, leading to what is known as a strong data-processing inequality.
Ian George +3 more
doaj +1 more source
, 2012 TLA+ is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA+ proofs and check them with TLAPS, the TLA+ Proof System.
Damien Doligez +15 more
core +7 more sources
Formal Analysis of Bakery-Based Mutual Exclusion Algorithms
ComputersLamport’s Bakery algorithm (LBA) represents a general and elegant solution to the mutual exclusion (ME) problem posed by Dijkstra in 1965. Its correctness is usually based on intuitive reasoning.
Libero Nigro
doaj +1 more source
Group Mutual Exclusion in Linear Time and Space
, 2015 We present two algorithms for the Group Mutual Exclusion (GME) Problem that satisfy the properties of Mutual Exclusion, Starvation Freedom, Bounded Exit, Concurrent Entry and First Come First Served.
Gafni, Eli +2 more
core +1 more source
Современные информационные технологии и IT-образование, 2018 The article describes working program for student course B1.V.04 «Distributed Computing Scheduling» which is taught during second semester of master course 01.04.02 «Applied Mathematics and Informatics» of «Math modeling» specialty.
Yuliana A. Kryzhanovskaya
doaj +1 more source
Leader Election in Anonymous Rings: Franklin Goes Probabilistic [PDF]
, 2008 We present a probabilistic leader election algorithm for anonymous, bidirectional, asynchronous rings. It is based on an algorithm from Franklin, augmented with random identity selection, hop counters to detect identity clashes, and round numbers modulo ...
A. Itai +16 more
core +7 more sources
Hierarchical token based mutual exclusion algorithms [PDF]
IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004., 2004 Mutual exclusion is a basic block of distributed synchronization algorithms. One of the challenge in highly distributed environments (like peer-to-peer or Grid configurations) is to provide scalable synchronizations taking into account the hierarchical network topology. This paper proposes hierarchical mutual exclusion algorithms.
Bertier, Marin +2 more
openaire +3 more sources
Synthesis of Parametric Programs using Genetic Programming and Model Checking [PDF]
, 2014 Formal methods apply algorithms based on mathematical principles to enhance the reliability of systems. It would only be natural to try to progress from verification, model checking or testing a system against its formal specification into constructing ...
Katz, Gal, Peled, Doron
core +2 more sources
IEEE Access, 2017 This paper presents a new method of computing a minimal supervisory structure that optimally enforces liveness on the Petri net models for flexible manufacturing systems (FMSs).
Muhammad Bashir +6 more
doaj +1 more source
Just Verification of Mutual Exclusion Algorithms
CoRRAn abbreviated version of this paper will appear in Proc.
van Glabbeek, Rob; id_orcid 0000-0003-4712-7423 +2 more
openaire +4 more sources