An extensional treatment of dataflow deadlock

DOI10.1016/0304-3975(81)90108-0zbMATH Open0441.68017OpenAlexW2177680287MaRDI QIDQ1143166FDOQ1143166

Authors: W. W. Wadge 

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/46328/1/WRAP_Wadge_cs-rr-028.pdf

zbMATH Keywords

deadlockequational dataflow languageextensional semantics of dataflow

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Design and correctness of a compiler for a non-procedural language
• Lucid, a nonprocedural language with iteration

Cited In (11)

• Verification of a class of self-timed computational networks
• A specification structure for deadlock-freedom of synchronous processes
• Lazy productivity via termination
• Productivity of stream definitions
• An extensional treatment of lazy data flow deadlock
• Upper Bounds on Stream I/O Using Semantic Interpretations
• Asymmetric completions of partial metric spaces
• Clocked lambda calculus
• Tameness in generalized metric structures
• Stratified negation in temporal logic programming and the cycle-sum test
• Completions of partial metrics into value lattices

Uses Software

• Lucid

This page was built for publication: An extensional treatment of dataflow deadlock

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143166)