scientific article; zbMATH DE number 176516

zbMATH Open0773.68004MaRDI QIDQ4035682FDOQ4035682

Authors:

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• On the undecidability of deadlock detection in families of nets
• On the complexity of deadlock detection in families of planar nets
• The pursuit of deadlock freedom
• scientific article; zbMATH DE number 3926230
• Deadlock analysis of unbounded process networks

zbMATH Keywords

deadlock detectionmassive parallelism

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (4)

• On the undecidability of deadlock detection in families of nets
• On the complexity of deadlock detection in families of planar nets
• Deadlock analysis of unbounded process networks
• Title not available (Why is that?)

This page was built for publication:

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