Faster possibility detection by combining two approaches

DOI10.1007/BFB0022156zbMATH Open1524.68221MaRDI QIDQ6084565FDOQ6084565

Authors: Scott D. Stoller, Fred B. Schneider 

Publication date: 1 December 2023

Published in: Distributed Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Gaussian elimination is not optimal
• Matrix multiplication via arithmetic progressions
• Title not available (Why is that?)
• Time, clocks, and the ordering of events in a distributed system
• Improved data structures for fully dynamic biconnectivity
• Reachability analysis on distributed executions

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)