Distributed mutual exclusion on a ring of processes
Science of Computer Programming
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Distributed Algorithms
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Empirical Evaluation of Distributed Mutual Exclusion Algorithms
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Selected Papers from the 3rd European Workshop on Applications and Theory of Petri Nets
Prioritized Token-Based Mutual Exclusion for Distributed Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Distributed mutual exclusion algorithms for grid applications: A hierarchical approach
Journal of Parallel and Distributed Computing
A Composition Approach to Mutual Exclusion Algorithms for Grid Applications
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
In distributed environments, the shared resources access control by mutual exclusion paradigm is a recurrent key problem. To cope with the new constraints implied by recently developed large scale distributed systems like grids, mutual exclusion algorithms become more and more complex and thus much harder to prove and/or verify. In this article, we propose the formal modeling and the verification of a new generic hierarchical approach. This approach is based on the composition of classical already proof checked distributed algorithms. It overcomes some limitations of these classical algorithms by taking into account the network topology latencies and have a high scalability where centralized ones don't. We also have formalized the properties of the mutual exclusion paradigm in order to verify them against our solution. We prove that our compositional approach preserves theses properties under the assumption that all used plain algorithms assert them. This verification by formal method checkers was eased by the efficient use of already proved mutual exclusion algorithms and the reduction of state spaces by exploiting the symmetries.