Pages that link to "Item:Q1151025"
From MaRDI portal
The following pages link to Deadlock absence proofs for networks of communicating processes (Q1151025):
Displaying 11 items.
- The pursuit of deadlock freedom (Q580970) (← links)
- A fixed point approach to parallel discrete event simulation (Q758225) (← links)
- A weakest precondition semantics for communicating processes (Q789174) (← links)
- On the suitability of trace semantics for modular proofs of communicating processes (Q1060004) (← links)
- Verification of a class of self-timed computational networks (Q1102099) (← links)
- Deadlock absence proofs for networks of communicating processes (Q1151025) (← links)
- A proof technique for communicating sequential processes (Q1153686) (← links)
- Control machines: A new model of parallelism for compositional specifications and their effective compilation (Q1177148) (← links)
- Deadlock analysis in networks of communicating processes (Q2638755) (← links)
- Efficient analysis of concurrent constraint logic programs (Q4630298) (← links)
- Logical models of discrete even systems: a comparative exposition (Q5955794) (← links)