Regularity and firing sequences of computation graphs

DOI10.1016/0022-0000(81)90018-0MaRDI QIDQ1159465zbMATH OpenOpenAlexFDO

Authors 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

bounded queue propertychange diagramlive marked graphnon-labelled partially ordered graphorder of firingsparallel computationrecurrence propertiesregular 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

• A Comparison of Some Theoretical Models of Parallel Computation
• scientific article; zbMATH DE number 3471613 (Why is no real title available?)
• scientific article; zbMATH DE number 3570327 (Why is no real title available?)
• scientific article; zbMATH DE number 3576679 (Why is no real title available?)
• scientific article; zbMATH DE number 3273524 (Why is no real title available?)
• scientific article; zbMATH DE number 3420254 (Why is no real title available?)
• Marked directed graphs
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• Scheduling Parallel Computations
• The equality problem for vector addition systems is undecidable
• The Organization of Computations for Uniform Recurrence Equations

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

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