An extensional treatment of dataflow deadlock
Wadge, W.W. (1979) An extensional treatment of dataflow deadlock. Technical Report. Department of Computer Science, Coventry, UK.
Download (1056Kb) | Preview
We discuss deadlock in reference to a simple equation data-flow language, and devise a test (the cycle sum test) which is applied to the dependency graph of a Program we use Kahn's extensional semantics of data-flow and give a purely extensional (non operational) proof that no program passing the cycle sum test can ever deadlock. The proof is based on the notions of size (length) and completeness in the domain of histories, and should extend to a much widen context.
|Item Type:||Monograph (Technical Report)|
|Additional Information:||W.W. Wadge, An Extensional treatment of Dataflow Deadlock, Theoretical Computer Science 13, pp. 3-15 (1981)|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Science > Computer Science|
|Depositing User:||Mr Ebrahim Ardeshir|
|Date Deposited:||27 Apr 2012 08:00|
|Last Modified:||01 Nov 2012 18:07|
Actions (login required)