Decidability and complexity results for verification of asynchronous broadcast networks

DOI10.1007/978-3-642-37064-9_22MaRDI QIDQ4910461zbMATH OpenOpenAlexFDO

Authors Giorgio Delzanno, Riccardo Traverso

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_22

zbMATH Keywords

verificationinfinite-state systemsbroadcast protocols

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Parameterized verification of coverability in infinite state broadcast networks
• On the complexity of parameterized reachability in reconfigurable broadcast networks
• Playing with probabilities in reconfigurable broadcast networks
• Reconfiguration and message losses in parameterized broadcast networks
• Parameterized verification of synchronization in constrained reconfigurable broadcast networks

Cited in

(9)

• scientific article; zbMATH DE number 7447739 (Why is no real title available?)
• Distributed local strategies in broadcast networks
• Playing with probabilities in reconfigurable broadcast networks
• Parameterized model checking of rendezvous systems
• Reconfiguration and message losses in parameterized broadcast networks
• Parameterized verification of coverability in infinite state broadcast networks
• Liveness in broadcast networks
• Parameterized verification of time-sensitive models of ad hoc network protocols
• Deciding determinism with fairness for simple transducer networks

This page was built for publication: Decidability and complexity results for verification of asynchronous broadcast networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910461)