Parameterized verification of time-sensitive models of ad hoc network protocols
DOI10.1016/J.TCS.2015.07.048zbMATH Open1332.68137OpenAlexW1190524203MaRDI QIDQ896913FDOQ896913
Authors: Parosh A. Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, Riccardo Traverso 
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
Recommendations
- On the Verification of Timed Ad Hoc Networks
- Parameterized verification of ad hoc networks
- Modeling and efficient verification of wireless ad hoc networks
- Query-Based Model Checking of Ad Hoc Network Protocols
- scientific article; zbMATH DE number 1982205
- Modeling and verifying ad hoc routing protocols
- scientific article; zbMATH DE number 3876567
- Parameterized verification and model checking for distributed broadcast protocols
- Parameterized verification of synchronization in constrained reconfigurable broadcast networks
graphsdecidabilitytimed automataad hoc networkswell-structured transition systemsparameterized verification
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)
Cites Work
- A theory of timed automata
- Parameterized Model Checking of Token-Passing Systems
- Reasoning about systems with many processes
- Title not available (Why is that?)
- CONCUR 2004 - Concurrency Theory
- Subgraphs and well‐quasi‐ordering
- Well-structured transition systems everywhere!
- Nets with tokens which carry data
- On Reasoning About Rings
- Decidable topologies for communicating automata with FIFO and bag channels
- Query-Based Model Checking of Ad Hoc Network Protocols
- On the power of cliques in the parameterized verification of ad hoc networks
- Parameterized verification of ad hoc networks
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
- Model checking of systems with many identical timed processes
- On the complexity of parameterized reachability in reconfigurable broadcast networks
- On the Verification of Timed Ad Hoc Networks
- A timed calculus for wireless systems
- Decidability and complexity results for verification of asynchronous broadcast networks
- Parameterized verification of broadcast networks of register automata
Cited In (8)
- On the Verification of Timed Ad Hoc Networks
- Query-Based Model Checking of Ad Hoc Network Protocols
- Parameterized verification of many identical probabilistic timed processes
- Parameterized verification of ad hoc networks
- On the power of cliques in the parameterized verification of ad hoc networks
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Methods for RTCP-Nets Modeling and Verification
- Parametric timed broadcast protocols
This page was built for publication: Parameterized verification of time-sensitive models of ad hoc network protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896913)
