Detecting locally stable predicates without modifying application messages

DOI10.1007/978-3-540-27860-3_5MaRDI QIDQ5466238zbMATH OpenOpenAlexFDO

Authors Ranganath Atreya, Neeraj Mittal, Vijay K. Garg

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Efficient detection of a locally stable predicate in a distributed system
• scientific article; zbMATH DE number 3956427
• Detection of global predicates: techniques and their limitations
• Detecting conjunctions of global predicates
• Efficient detection of a class of stable properties

Cited in

(9)

• Intractability results in predicate detection
• A family of optimal termination detection algorithms
• Eventually perfect predicate detection in crash-affected finite average response time systems
• scientific article; zbMATH DE number 3956427 (Why is no real title available?)
• On Detection of Bounded Global Predicates
• Efficient detection of a class of stable properties
• Detection of global predicates: techniques and their limitations
• Detecting global predicates in distributed systems with clocks
• Efficient detection of a locally stable predicate in a distributed system

This page was built for publication: Detecting locally stable predicates without modifying application messages

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