A method of computing minimum firing time for self-cleaning SWITCH-less program nets

DOI10.1016/S0016-0032(97)00017-3zbMath0973.68180MaRDI QIDQ5942204

Qi-Wei Ge, Hidenori Yanagida

Publication date: 28 August 2001

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

zbMATH Keywords

data-flow programs

Mathematics Subject Classification ID

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

Related Items (1)

PARAdeg-processor scheduling for acyclic SWITCH-less program nets

Uses Software

• Unnamed Item

Cites Work

• Execution termination and computation determinacy of data-flow program nets
• A Data Flow Multiprocessor
• Unnamed Item

This page was built for publication: A method of computing minimum firing time for self-cleaning SWITCH-less program nets