scientific article
From MaRDI portal
Publication:2957507
DOI10.4230/LIPIcs.FSTTCS.2012.289zbMath1354.68014MaRDI QIDQ2957507
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro, Riccardo Traverso
Publication date: 26 January 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (10)
Unnamed Item ⋮ Liveness in broadcast networks ⋮ Modeling and efficient verification of wireless ad hoc networks ⋮ Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy ⋮ Parameterized verification of time-sensitive models of ad hoc network protocols ⋮ Parameterized analysis of reconfigurable broadcast networks ⋮ Unnamed Item ⋮ Finding cut-offs in leaderless rendez-vous protocols is easy ⋮ The complexity of verifying population protocols ⋮ Parameterized verification of coverability in infinite state broadcast networks
This page was built for publication:
