Abstract
This paper deals with execution termination and computation determinacy of data-flow program nets, which are extended from conventional data-flow program graphs by allowing edge thresholds α and β to be any positive integer number, while a conventional data-flow graph has α = β = 1. First detailed description of program nets is presented and then the problems of execution termination and computation determinacy of a given data-flow program net are analysed. Through structural analysis of net activities, the following results are obtained in this paper: (1) necessary and sufficient conditions for any execution of a switchless net to terminate; (2) sufficient conditions for any execution of a program net, including SWITCH-nodes, to terminate; and (3) sufficient conditions of computation determinacy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
