Regularity and firing sequences of computation graphs
From MaRDI portal
Publication:1159465
DOI10.1016/0022-0000(81)90018-0zbMath0475.68036MaRDI QIDQ1159465
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
parallel computation; recurrence properties; bounded queue property; change diagram; live marked graph; non-labelled partially ordered graph; order of firings; regular strongly connected computation graph
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item