Relevance of network theory to models of distributed/parallel processing

DOI10.1016/0016-0032(80)90060-5MaRDI QIDQ1138905zbMATH OpenOpenAlexFDO

Authors 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 detectionnetwork theoryparallel processingdistributed processingmarked graphs

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 3493844 (Why is no real title available?)
• scientific article; zbMATH DE number 3557247 (Why is no real title available?)
• Circuit theoretic analysis and synthesis of marked graphs
• Discrete Systems and Flowcharts
• Marked directed graphs
• Models for parallel processing within programs
• Parametric Analysis of Queuing Networks

Cited in

(1)

• A method for stepwise refinement and abstraction of Petri nets

This page was built for publication: Relevance of network theory to models of distributed/parallel processing

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