Relevance of network theory to models of distributed/parallel processing

DOI10.1016/0016-0032(80)90060-5zbMath0432.68017OpenAlexW2020253122MaRDI QIDQ1138905

Tadao Murata

Publication date: 1980

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(80)90060-5

zbMATH Keywords

fault detectionparallel processingnetwork theorydistributed processingmarked graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20) Theory of operating systems (68N25)

Related Items

A method for stepwise refinement and abstraction of Petri nets

Cites Work

• Marked directed graphs
• Parametric Analysis of Queuing Networks
• Models for parallel processing within programs
• Discrete Systems and Flowcharts
• Circuit theoretic analysis and synthesis of marked graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item