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

DOI10.1007/978-3-030-71995-1_3OpenAlexW3148956417MaRDI QIDQ2233393

A. R. Balasubramanian, Mikhail Raskin, Javier Esparza

Publication date: 18 October 2021

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

zbMATH Keywords

Petri netscut-off problemrendez-vous protocols

Mathematics Subject Classification ID

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

Related Items (2)

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy ⋮ Lower bounds on the state complexity of population protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verification of population protocols
• Computation with finite stochastic chemical reaction networks
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Computation in networks of passively mobile finite-state sensors
• Complexity Analysis of Continuous Petri Nets
• CONTINUOUS PETRI NETS: EXPRESSIVE POWER AND DECIDABILITY ISSUES
• Symbolic Counter Abstraction for Concurrent Software
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• On the complexity of integer programming
• Reasoning about systems with many processes
• Decidability of Parameterized Verification
• Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms
• The reachability problem for Petri nets is not elementary

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