Faster possibility detection by combining two approaches

DOI10.1007/BFB0022156MaRDI QIDQ6084565zbMATH OpenFDO

Authors Scott D. Stoller, Fred B. Schneider

Publication date 1 December 2023

Published in Distributed Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1670782
• Detecting conjunctions of global predicates
• Formal Approaches to Software Testing
• Detection of global predicates: techniques and their limitations
• Detecting global predicates in distributed systems with clocks

Cites work

• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 192916 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Improved data structures for fully dynamic biconnectivity
• Matrix multiplication via arithmetic progressions
• Reachability analysis on distributed executions
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: Faster possibility detection by combining two approaches

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