Layered reasoning for randomized distributed algorithms

DOI10.1007/s00165-012-0231-xzbMath1259.68114OpenAlexW1999872864WikidataQ57801088 ScholiaQ57801088MaRDI QIDQ1941864

Mani Swaminathan, Ernst-Ruediger Olderog, Joost-Pieter Katoen

Publication date: 22 March 2013

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-012-0231-x

zbMATH Keywords

probabilistic automatacommunication closednesslayered composition and separationpartial order equivalencerandomizedmutual exclusion

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (1)

Structural transformations for data-enriched real-time systems

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear process-algebraic format with data for probabilistic automata
• Using probabilistic Kleene algebra pKA for protocol verification
• Analyzing security protocols using time-bounded task-PIOAs
• Decomposition of distributed programs into communication-closed layers
• N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable
• A principle for sequential reasoning about distributed algorithms
• A Layered Analysis of Consensus
• Confluence Reduction for Probabilistic Systems
• Layered Composition for Timed Automata
• From sequential layers to distributed processes
• Proving probabilistic correctness statements
• Randomized mutual exclusion algorithms revisited

This page was built for publication: Layered reasoning for randomized distributed algorithms