Abstract
As a graphical language, the Business Process Modelling Notation (BPMN) plays an important role in enterprise information systems. BPMN is a standard notation for capturing business processes, while Business Process Execution Language (BPEL) provides a standard executable language for specifying business process compositions and interactions. This paper proposes a new method based on graph grammars to map from BPMN to BPEL codes. In the first place, the existing Edge-based Graph Grammar (EGG) is introduced, which is a context-sensitive grammar and a new formal method for simply specifying graph grammars. Secondly, some aspects of EGGs are extended to conveniently map from BPMN to BPEL. Finally, new mapping steps and a parsing algorithm are put forward, which achieve a goal of this paper.
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.
