Implementation of Deadlock Analysis in Data Flow Graphs

DOI10.1080/02522667.1992.10699093zbMath0800.68193OpenAlexW1964630521MaRDI QIDQ4008471

Bruce Brocka

Publication date: 27 September 1992

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1992.10699093

zbMATH Keywords

VLSI designdirected graphdeadlockdata flow graphsdeadlock-free graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Towards a Theory of Universal Speed-Independent Modules
• A Survey of Regular Expressions and Their Applications
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• Derivatives of Regular Expressions
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: Implementation of Deadlock Analysis in Data Flow Graphs