Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

DOI10.46298/lmcs-19(4:2)2023arXiv2010.09471OpenAlexW4387580125MaRDI QIDQ6076175

Mikhail Raskin, Javier Esparza, A. R. Balasubramanian

Publication date: 23 October 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Petri netscut-off problemrendez-vous protocols

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

Cites Work

• Verification of population protocols
• Computation with finite stochastic chemical reaction networks
• Real addition and the polynomial hierarchy
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Finding cut-offs in leaderless rendez-vous protocols is easy
• 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
• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy