Finding cut-offs in leaderless rendez-vous protocols is easy

DOI10.1007/978-3-030-71995-1_3MaRDI QIDQ2233393zbMATH OpenOpenAlexFDO

Authors A. R. Balasubramanian, Javier Esparza, Mikhail Raskin

Publication date 18 October 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2010.09471

zbMATH Keywords

cut-off problemPetri netsrendez-vous protocols

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
• Fast leader-election protocols with bounded cheaters' edge
• Cutoff bounds for consensus algorithms
• scientific article; zbMATH DE number 7204593
• scientific article; zbMATH DE number 2080260
• A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
• New lower bound techniques for distributed leader finding and other problems on rings of processors

Cites work

• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Complexity analysis of continuous Petri nets
• Computation in networks of passively mobile finite-state sensors
• Computation with finite stochastic chemical reaction networks
• Continuous Petri nets: expressive power and decidability issues
• Decidability of parameterized verification
• scientific article; zbMATH DE number 3637601 (Why is no real title available?)
• scientific article; zbMATH DE number 1302047 (Why is no real title available?)
• scientific article; zbMATH DE number 2080053 (Why is no real title available?)
• scientific article; zbMATH DE number 194764 (Why is no real title available?)
• scientific article; zbMATH DE number 1903348 (Why is no real title available?)
• scientific article; zbMATH DE number 827979 (Why is no real title available?)
• scientific article; zbMATH DE number 7559502 (Why is no real title available?)
• On the complexity of integer programming
• On the complexity of parameterized reachability in reconfigurable broadcast networks
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Reasoning about systems with many processes
• Symbolic Counter Abstraction for Concurrent Software
• The reachability problem for Petri nets is not elementary
• Tutorial on parameterized model checking of fault-tolerant distributed algorithms
• Verification of population protocols

Cited in

(2)

• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
• Safety analysis of parameterised networks with non-blocking rendez-vous

This page was built for publication: Finding cut-offs in leaderless rendez-vous protocols is easy

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