Wadge, William W. (1979) An extensional treatment of dataflow deadlock. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

Preview

Text WRAP_Wadge_cs-rr-028.pdf - Published Version Download (1151Kb) | Preview

Request Changes to record.

Abstract

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:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Data flow computing, Computer programs -- Termination
Series Name:	Theory of Computation Report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	April 1979
Dates:	Date Event April 1979 ["eprint_fieldopt_dates_date_type_available" not defined]
Date of first compliant deposit:	1 August 2016
Number:	Number 28
Number of Pages:	15
DOI:	CS-RR-028
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Publisher Statement:	W.W. Wadge, An Extensional treatment of Dataflow Deadlock, Theoretical Computer Science 13, pp. 3-15 (1981)
Access rights to Published version:	Open Access
Description:	Presented at the July 1979 Conference on Semantics of Concurrent Computations, Evian, France.
Version or Related Resource:	Wadge, W.W. (1981). An extensional treatment of dataflow deadlock. Theoretical Computer Science, 13, pp. 3-15.

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads