The following pages link to (Q2957507):
Displaying 12 items.
- Parameterized verification of time-sensitive models of ad hoc network protocols (Q896913) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Modeling and efficient verification of wireless ad hoc networks (Q1688557) (← links)
- The complexity of verifying population protocols (Q2025857) (← links)
- Parameterized verification of coverability in infinite state broadcast networks (Q2029598) (← links)
- Finding cut-offs in leaderless rendez-vous protocols is easy (Q2233393) (← links)
- Liveness in broadcast networks (Q2676223) (← links)
- (Q3384884) (← links)
- (Q5856427) (← links)
- Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy (Q6076175) (← links)
- Parameterized broadcast networks with registers: from NP to the frontiers of decidability (Q6629529) (← links)
- Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent (Q6649512) (← links)