Parameterized verification of time-sensitive models of ad hoc network protocols

DOI10.1016/j.tcs.2015.07.048zbMath1332.68137OpenAlexW1190524203MaRDI QIDQ896913

Riccardo Traverso, Arnaud Sangnier, Giorgio Delzanno, Parosh Aziz Abdulla, Othmane Rezine

Publication date: 15 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.048

zbMATH Keywords

graphstimed automatadecidabilityad hoc networkswell-structured transition systemsparameterized verification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Related Items

On the Verification of Timed Ad Hoc Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Model checking of systems with many identical timed processes
• Parameterized Model Checking of Token-Passing Systems
• On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks
• On the Verification of Timed Ad Hoc Networks
• Query-Based Model Checking of Ad Hoc Network Protocols
• Decidable Topologies for Communicating Automata with FIFO and Bag Channels
• A Timed Calculus for Wireless Systems
• Parameterized Verification of Ad Hoc Networks
• Subgraphs and well‐quasi‐ordering
• Reasoning about systems with many processes
• Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks
• Parameterized Verification of Broadcast Networks of Register Automata
• CONCUR 2004 - Concurrency Theory
• Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
• On Reasoning About Rings
• Well-structured transition systems everywhere!