Layered reasoning for randomized distributed algorithms
type: Item
instance of: scholarly article
title: Layered reasoning for randomized distributed algorithms
zbMATH Open document ID: 1259.68114
author: Mani Swaminathan
author: Ernst-Rüdiger Olderog
author: Joost-Pieter Katoen
published in: Formal Aspects of Computing
publication date: 2013-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6148334
zbMATH Keywords: probabilistic automata
zbMATH Keywords: layered composition and separation
zbMATH Keywords: communication closedness
zbMATH Keywords: partial order equivalence
zbMATH Keywords: randomizedmutual exclusion
Wikidata QID: Q57801088
describes a project that uses: PRISM
MaRDI profile type: Publication
full work available at URL: s00165-012-0231-x
OpenAlex ID: W1999872864
cites work: Q3549610
cites work: Analyzing security protocols using time-bounded task-PIOAs
cites work: Decomposition of distributed programs into communication-closed layers
cites work: From sequential layers to distributed processes
cites work: Q4422079
cites work: Randomized mutual exclusion algorithms revisited
cites work: A linear process-algebraic format with data for probabilistic automata
cites work: Using probabilistic Kleene algebra pKA for protocol verification
cites work: Q3992568
cites work: A layered analysis of consensus
cites work: Layered Composition for Timed Automata
cites work: N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable
cites work: Proving probabilistic correctness statements
cites work: A principle for sequential reasoning about distributed algorithms
cites work: Q4547768
cites work: Q4847023
cites work: Q3395949
cites work: Confluence Reduction for Probabilistic Systems
DBLP publication ID: journals/fac/SwaminathanKO12
DOI: 10.1007/S00165-012-0231-X
description: scientific article; zbMATH DE number 6148334