Results 31 to 40 of about 61,865 (169)

Formal Modeling and Verification of Lycklama and Hadzilacos’s Mutual Exclusion Algorithm

Mathematics
This study describes our thorough experience of formal modeling and exhaustive verification of concurrent systems, particularly mutual exclusion algorithms. The experience focuses on Lycklama and Hadzilacos’s (LH) mutual exclusion algorithm.
Libero Nigro
doaj   +1 more source

Peterson's mutual exclusion algorithm revisited

Science of Computer Programming, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sommen, van der, F.W., Feijen, W.H.J., Gasteren, van, A.J.M.   +2 more
openaire   +3 more sources

How to decide? Different methods of calculating gene expression from short oligonucleotide array data will give different results

BMC Bioinformatics, 2006
Background Short oligonucleotide arrays for transcript profiling have been available for several years. Generally, raw data from these arrays are analysed with the aid of the Microarray Analysis Suite or GeneChip Operating Software (MAS or GCOS) from ...
Voesenek Laurentius ACJ, van Zanten Martijn, May Sean T, Okyere John, Millenaar Frank F, Peeters Anton JM   +5 more
doaj   +1 more source

Modal µ-Calculus, Model Checking and Gauß Elimination [PDF]

, 1995
In this paper we present a novel approach for solving Boolean equation systems with nested minimal and maximal fixpoints. The method works by successively eliminating variables and reducing a Boolean equation system similar to Gauß elimination for linear
Mader, Angelika
core   +4 more sources

Proving Properties of Dekker’s Algorithm for Mutual Exclusion of N Processes

Algorithms
Dekker’s algorithm for mutual exclusion of two processes is the well-known first developed correct solution based only on software mechanisms. The algorithm served as the starting point for researchers to create subsequent safe solutions both for two and
Libero Nigro, Franco Cicirelli
doaj   +1 more source

Self-stabilizing tree algorithms

, 1995
Designers of distributed algorithms have to contend with the problem of making the algorithms tolerant to several forms of coordination loss, primarily faulty initialization. The processes in a distributed system do not share a global memory and can only
Thiagarajan, Visalakshi
core   +1 more source

Stop It, and Be Stubborn! [PDF]

, 2015
A system is AG EF terminating, if and only if from every reachable state, a terminal state is reachable. This publication argues that it is beneficial for both catching non-progress errors and stubborn set state space reduction to try to make ...
Valmari, Antti
core   +2 more sources

Progressive Reinforcement Learning for Point-Feature Label Placement in Map Annotation

ISPRS International Journal of Geo-Information
In the era of information explosion, the effective configuration of labels on maps is crucial for the rapid comprehension of information. The point-feature label placement problem, particularly in large-scale and high-density scenarios with spatial ...
Wen Cao, Yinbao Zhang, Runsheng Li, Liqiu Ren, He Chen   +4 more
doaj   +1 more source

Impossibility Results for Byzantine-Tolerant State Observation, Synchronization, and Graph Computation Problems

Algorithms
This paper considers the solvability of several fundamental problems in asynchronous message-passing distributed systems in the presence of Byzantine processes using distributed algorithms.
Ajay D. Kshemkalyani, Anshuman Misra
doaj   +1 more source

An asynchronous message-passing distributed algorithm for the global critical section problem

, 2018
This paper considers the global $(l,k)$-CS problem which is the problem of controlling the system in such a way that, at least $l$ and at most $k$ processes must be in the CS at a time in the network.
Kakugawa, Hirotsugu, Kamei, Sayaka
core   +1 more source