Regularity and firing sequences of computation graphs

DOI10.1016/0022-0000(81)90018-0zbMath0475.68036OpenAlexW1998021349MaRDI QIDQ1159465

Tsuyoshi Nakamura

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90018-0

zbMATH Keywords

parallel computationrecurrence propertiesbounded queue propertychange diagramlive marked graphnon-labelled partially ordered graphorder of firingsregular strongly connected computation graph

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equality problem for vector addition systems is undecidable
• Marked directed graphs
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• Scheduling Parallel Computations
• The Organization of Computations for Uniform Recurrence Equations
• A Comparison of Some Theoretical Models of Parallel Computation

This page was built for publication: Regularity and firing sequences of computation graphs