Efficient detection of restricted classes of global predicates
From MaRDI portal
Publication:6084564
DOI10.1007/bfb0022155zbMath1524.68212MaRDI QIDQ6084564
Publication date: 1 December 2023
Published in: Distributed Algorithms (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
Producing Short Counterexamples Using “Crucial Events” ⋮ Detection of Disjunctive Normal Form Predicate in Distributed Systems ⋮ On Detecting Regular Predicates in Distributed Systems
Cites Work
- Some optimal algorithms for decomposed partially ordered sets
- Detecting causal relationships in distributed computations: In search of the holy grail
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- Recovery in distributed systems using optimistic message logging and checkpointing
This page was built for publication: Efficient detection of restricted classes of global predicates