scientific article; zbMATH DE number 7327956

MaRDI QIDQ5856427

Patricia Bouyer, Nathalie Bertrand, Anirban Majumdar

Publication date: 26 March 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Population protocols with unreliable communication ⋮ The complexity of verifying population protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Proving properties of a ring of finite-state machines
• Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
• Parameterized Verification of Asynchronous Shared-Memory Systems
• Parameterized Verification of Ad Hoc Networks
• Reasoning about systems with many processes
• Reducibility among Combinatorial Problems
• Playing with Probabilities in Reconfigurable Broadcast Networks