Pages that link to "Item:Q2892733"

The following pages link to A Process Algebra for Wireless Mesh Networks (Q2892733):

Displaying 15 items.

• Mechanizing a process algebra for network protocols (Q287372) (← links)
• Modelling and verifying the AODV routing protocol (Q324632) (← links)
• Revisiting sequential composition in process calculi (Q890611) (← links)
• Modeling and efficient verification of wireless ad hoc networks (Q1688557) (← links)
• A semantic theory of the Internet of things (Q1706144) (← links)
• Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
• A tale of two graph models: a case study in wireless sensor networks (Q2065559) (← links)
• Analysis of mobile networks' protocols based on abstract state machine (Q2117591) (← links)
• Out for coffee: with Rob (Q2182661) (← links)
• Automatic construction of systems of distributed components from nested Petri nets models (Q2216722) (← links)
• A calculus of branching processes (Q2286743) (← links)
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
• Model checking mobile ad hoc networks (Q2363813) (← links)
• A Timed Process Algebra for Wireless Networks with an Application in Routing (Q2802472) (← links)
• The Expressive Power of Monotonic Parallel Composition (Q2802500) (← links)