Abstract
This paper exhibits the extension of a formal semantics of a parallel programming language, based on high-level Petri nets, in order to cope with procedures. The solution is based on refinement and synchronization operations of high-level Petri nets. It inherits thus properties of the Petri net model, in particular the coherence with elementary Petri nets on which verification techniques are based. Furthermore, the approach formalizes nicely the intuition behind procedures and their parameters, while in the absence of procedures, our definition and the existing semantics coincide.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.