NDLI: Layered reasoning for randomized distributed algorithms

Content Provider	Springer Nature Link
Author	Swaminathan, Mani Katoen, Joost Pieter Olderog, Ernst Rüdiger
Copyright Year	2012
Abstract	This paper adopts the communication closed layer (CCL) concept of Elrad and Francez to the formal reasoning of randomized distributed algorithms. We do so by enriching probabilistic automata (PA) with a layered composition operator, an intermediate between parallel and sequential composition. Layered composition is used to establish probabilistic counterparts of the CCL laws that exploit independence and/or precedence conditions between the constituent PA. The probabilistic CCL laws enable partial order (po-) equivalence when layered composition is replaced by sequential composition. Such po-equivalence induces a purely syntactic partial-order state space reduction via layered separation in compositions of PA while preserving probabilistic next-free linear-time properties. The feasibility of such layered separation is demonstrated on a randomized mutual exclusion algorithm by Kushilevitz and Rabin, complementing an algebraic approach (for analyzing this algorithm) by McIver, Gonzalia, Cohen, and Morgan.
Starting Page	477
Ending Page	496
Page Count	20
File Format	PDF
ISSN	09345043
Journal	Formal Aspects of Computing
Volume Number	24
Issue Number	4-6
e-ISSN	1433299X
Language	English
Publisher	Springer-Verlag
Publisher Date	2012-06-29
Publisher Place	London
Access Restriction	Subscribed
Subject Keyword	Probabilistic automata Layered composition and separation Communication closedness Partial order equivalence Randomizedmutual exclusion Computational Mathematics and Numerical Analysis Theory of Computation Math Applications in Computer Science
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Layered reasoning for randomized distributed algorithms (2012).

Structural transformations for data-enriched real-time systems

Modeling layered distributed communication systems

Program equivalence by circular reasoning

Exploring probabilistic bisimulations, part I

Using schedulers to test probabilistic distributed systems

Deciding probabilistic automata weak bisimulation: theory and practice

Compositional reasoning about active objects with shared futures

Probabilistic may/must testing: retaining probabilities by restricted schedulers

Layered reasoning for randomized distributed algorithms

Similar Documents

Layered reasoning for randomized distributed algorithms (2012).

Structural transformations for data-enriched real-time systems

Modeling layered distributed communication systems

Program equivalence by circular reasoning

Exploring probabilistic bisimulations, part I

Using schedulers to test probabilistic distributed systems

Deciding probabilistic automata weak bisimulation: theory and practice

Compositional reasoning about active objects with shared futures

Probabilistic may/must testing: retaining probabilities by restricted schedulers

Layered reasoning for randomized distributed algorithms