Execution termination and computation determinacy of data-flow program nets

DOI10.1016/0016-0032(91)90010-ZzbMath0717.68012OpenAlexW2017653560MaRDI QIDQ2638758

Toshimasa Watanabe, Qi-Wei Ge, Kenji Onaga

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0016-0032(91)90010-z

zbMATH Keywords

Petri netprogram nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General topics in the theory of software (68N01)

Related Items (2)

PARAdeg-processor scheduling for acyclic SWITCH-less program nets ⋮ A method of computing minimum firing time for self-cleaning SWITCH-less program nets

Cites Work

• Unnamed Item
• Unnamed Item
• Data flow analysis of program nets
• Termination Properties of Generalized Petri Nets
• A Data Flow Multiprocessor
• Properties of Conflict-Free and Persistent Petri Nets
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing

This page was built for publication: Execution termination and computation determinacy of data-flow program nets