Efficient detection of restricted classes of global predicates

DOI10.1007/BFB0022155MaRDI QIDQ6084564zbMATH OpenFDO

Authors Craig M. Chase, Vijay K. Garg

Publication date 1 December 2023

Published in Distributed Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0022155

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Detection of global predicates: techniques and their limitations
• On Detection of Bounded Global Predicates
• Detecting conjunctions of global predicates
• Efficient abstraction algorithms for predicate detection
• Efficient Predicate Evaluation Using Randomized Degeneracy Detection
• Precluding useless events for on-line global predicate detections

Cites work

• Detecting causal relationships in distributed computations: In search of the holy grail
• Recovery in distributed systems using optimistic message logging and checkpointing
• Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
• Some optimal algorithms for decomposed partially ordered sets

Cited in

(4)

• Producing Short Counterexamples Using “Crucial Events”
• On Detecting Regular Predicates in Distributed Systems
• Detection of Disjunctive Normal Form Predicate in Distributed Systems
• Tolerance to asynchrony in algorithms for multiplication and modulo

This page was built for publication: Efficient detection of restricted classes of global predicates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084564)