Parameterized verification of coverability in infinite state broadcast networks

DOI10.1016/j.ic.2020.104592zbMath1497.68285OpenAlexW3034544431MaRDI QIDQ2029598

A. R. Balasubramanian

Publication date: 3 June 2021

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2020.104592

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The covering and boundedness problems for vector addition systems
• Verifying programs with unreliable channels
• Parameterized verification of synchronization in constrained reconfigurable broadcast networks
• Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
• On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks
• On the Verification of Timed Ad Hoc Networks
• On Moore Graphs with Diameters 2 and 3
• Parameterized Verification of Ad Hoc Networks
• Subgraphs and well‐quasi‐ordering
• Reasoning about systems with many processes
• Reachability in Networks of Register Protocols under Stochastic Schedulers
• Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks
• Parameterized Verification of Broadcast Networks of Register Automata
• Playing with Probabilities in Reconfigurable Broadcast Networks
• Well-structured transition systems everywhere!
• Reachability analysis of pushdown automata: Application to model-checking

This page was built for publication: Parameterized verification of coverability in infinite state broadcast networks