Implementation of Deadlock Analysis in Data Flow Graphs

DOI10.1080/02522667.1992.10699093MaRDI QIDQ4008471zbMATH OpenOpenAlexFDO

Authors 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

data flow graphsdeadlockdeadlock-free graphsdirected graphVLSI design

Mathematics Subject Classification ID

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

Cites work

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

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

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