%0 Book Section %1 dijkman2011bpmn %A Dijkman, Remco %A Gorp, Pieter %B Business Process Modeling Notation %D 2011 %E Mendling, Jan %E Weidlich, Matthias %E Weske, Mathias %I Springer Berlin Heidelberg %K bpmn execution semantics %P 16-30 %R 10.1007/978-3-642-16298-5_4 %T BPMN 2.0 Execution Semantics Formalized as Graph Rewrite Rules %U http://dx.doi.org/10.1007/978-3-642-16298-5_4 %V 67 %X This paper presents a formalization of a subset of the BPMN 2.0 execution semantics in terms of graph rewrite rules. The formalization is supported by graph rewrite tools and implemented in one of these tools, called GrGen. The benefit of formalizing the execution semantics by means of graph rewrite rules is that there is a strong relation between the execution semantics rules that are informally specified in the BPMN 2.0 standard and their formalization. This makes it easy to validate the formalization. Having a formalized and implemented execution semantics supports simulation, animation and execution of BPMN 2.0 models. In particular this paper explains how to use the formal execution semantics to verify workflow engines and service orchestration and choreography engines that use BPMN 2.0 for modeling the processes that they execute. %@ 978-3-642-16297-8

@incollection{dijkman2011bpmn, abstract = {This paper presents a formalization of a subset of the BPMN 2.0 execution semantics in terms of graph rewrite rules. The formalization is supported by graph rewrite tools and implemented in one of these tools, called GrGen. The benefit of formalizing the execution semantics by means of graph rewrite rules is that there is a strong relation between the execution semantics rules that are informally specified in the BPMN 2.0 standard and their formalization. This makes it easy to validate the formalization. Having a formalized and implemented execution semantics supports simulation, animation and execution of BPMN 2.0 models. In particular this paper explains how to use the formal execution semantics to verify workflow engines and service orchestration and choreography engines that use BPMN 2.0 for modeling the processes that they execute.}, added-at = {2013-06-01T18:44:55.000+0200}, author = {Dijkman, Remco and Gorp, Pieter}, biburl = {https://www.bibsonomy.org/bibtex/2674ace5549d8a04fadb3a5847e0c3265/porta}, booktitle = {Business Process Modeling Notation}, description = {BPMN 2.0 Execution Semantics Formalized as Graph Rewrite Rules - Springer}, doi = {10.1007/978-3-642-16298-5_4}, editor = {Mendling, Jan and Weidlich, Matthias and Weske, Mathias}, file = {dijkman2011bpmn.pdf:dijkman2011bpmn.pdf:PDF}, groups = {public}, interhash = {4d2995a476d9300dc3b24028e2092304}, intrahash = {674ace5549d8a04fadb3a5847e0c3265}, isbn = {978-3-642-16297-8}, keywords = {bpmn execution semantics}, pages = {16-30}, publisher = {Springer Berlin Heidelberg}, series = {Lecture Notes in Business Information Processing}, timestamp = {2013-08-09T11:52:58.000+0200}, title = {BPMN 2.0 Execution Semantics Formalized as Graph Rewrite Rules}, url = {http://dx.doi.org/10.1007/978-3-642-16298-5_4}, username = {porta}, volume = 67, year = 2011 }