Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks

DOI10.1007/978-3-642-37064-9_22zbMath1377.68130OpenAlexW16257490MaRDI QIDQ4910461

Riccardo Traverso, Giorgio Delzanno

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

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

Related Items (4)

Parameterized model checking of rendezvous systems ⋮ Parameterized verification of time-sensitive models of ad hoc network protocols ⋮ Unnamed Item ⋮ Parameterized verification of coverability in infinite state broadcast networks

This page was built for publication: Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks