Solvability of the asynchronous ranking problem

DOI10.1016/0020-0190(88)90193-7zbMath0664.68026OpenAlexW1972091330MaRDI QIDQ1115578

Antoni Mazurkiewicz

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90193-7

zbMATH Keywords

solvabilityfinite automatadistributed systemfinite state machinesranking problem

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Theory of operating systems (68N25)

Related Items (8)

Distributed enumeration ⋮ Locally computable enumerations ⋮ Leader election in plane cellular automata, only with left-right global convention ⋮ Analysis of a randomized rendezvous algorithm ⋮ Election in partially anonymous networks with arbitrary knowledge in message passing systems ⋮ Distributed disassembly of mosaics ⋮ Uniform election in trees and polyominoids ⋮ Snap-stabilizing tasks in anonymous networks

Cites Work

• A new solution of Dijkstra's concurrent programming problem
• Unnamed Item

This page was built for publication: Solvability of the asynchronous ranking problem