Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
Abstract: We study networks of processes that all execute the same finite protocol and communicate synchronously in two different ways: a process can broadcast one message to all other processes or send it to at most one other process. In both cases, if no process can receive the message, it will still be sent. We establish a precise complexity class for two coverability problems with a parameterised number of processes: the state coverability problem and the configuration coverability problem. It is already known that these problems are Ackermann-hard (but decidable) in the general case. We show that when the protocol is Wait-Only, i.e., it has no state from which a process can send and receive messages, the complexity drops to P and PSPACE, respectively.
- Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett., 22(6):307–309, 1986.
- On the expressive power of communication primitives in parameterised systems. In LPAR’15, volume 9450 of Lecture Notes in Computer Science, pages 313–328. Springer, 2015.
- Finding cut-offs in leaderless rendez-vous protocols is easy. In FOSSACS’21, volume 12650 of LNCS, pages 42–61. Springer, 2021.
- Model checking parameterized asynchronous shared-memory systems. Formal Methods in System Design, 50(2-3):140–167, 2017.
- Towards the automated verification of multithreaded java programs. In TACAS’02, volume 2280 of LNCS, pages 173–187. Springer, 2002.
- On the complexity of parameterized reachability in reconfigurable broadcast networks. In FSTTCS’12, volume 18 of LIPIcs, pages 289–300. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.
- On the verification of broadcast protocols. In LICS’99, pages 352–359. IEEE Comp. Soc. Press, July 1999.
- E. Allen Emerson and V. Kahlon. Model checking guarded protocols. In (LICS 2003, pages 361–370. IEEE, 2003.
- Reasoning about systems with many processes. Journal of the ACM, 39(3):675–735, 1992.
- Safety analysis of parameterised networks with non-blocking rendez-vous. In CONCUR’23, volume 279 of LIPIcs, pages 7:1–7:17. loss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
- F. Horn and A. Sangnier. Deciding the existence of cut-off in parameterized rendez-vous networks. In CONCUR’20, volume 171 of LIPIcs, pages 46:1–46:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
- Dexter Kozen. Lower bounds for natural proof systems. In FOCS’77, pages 254–266. IEEE Computer Society, 1977.
- Richard E. Ladner. The circuit value problem is log space complete for P. SIGACT News, 7(1):18–20, 1975.
- S. Schmitz and P. Schnoebelen. The power of well-structured systems. In CONCUR’13, volume 8052 of Lecture Notes in Computer Science, pages 5–24. Springer, 2013.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.