An extensional treatment of dataflow deadlock

DOI10.1016/0304-3975(81)90108-0zbMath0441.68017OpenAlexW2177680287MaRDI QIDQ1143166

William 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)

Related Items (11)

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

Uses Software

• Lucid

Cites Work

• Design and correctness of a compiler for a non-procedural language
• Lucid, a nonprocedural language with iteration
• Unnamed Item
• Unnamed Item
• Unnamed Item

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