Pages that link to "Item:Q2638755"
From MaRDI portal
The following pages link to Deadlock analysis in networks of communicating processes (Q2638755):
Displaying 13 items.
- The pursuit of deadlock freedom (Q580970) (← links)
- A CCS-based investigation of deadlock in a multi-process electronic mail system (Q688829) (← links)
- Deadlock analysis of unbounded process networks (Q729810) (← links)
- A semantics for concurrent separation logic (Q879367) (← links)
- Exposure to deadlock for communicating processes is hard to detect (Q1064050) (← links)
- On the analysis of cooperation and antagonism in networks of communicating processes (Q1098279) (← links)
- A deadlock free and starvation free network of packet switching communication processors (Q1116325) (← links)
- Discovering and correcting a deadlock in a channel implementation (Q2322306) (← links)
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
- Deadlock-freedom in component systems with architectural constraints (Q2441719) (← links)
- Construction of Deadlock-free Designs of Communication Protocols from Observations (Q4542805) (← links)
- Efficient analysis of concurrent constraint logic programs (Q4630298) (← links)
- Logical models of discrete even systems: a comparative exposition (Q5955794) (← links)