Kossak / Illibauer / Geist | A Rigorous Semantics for BPMN 2.0 Process Diagrams | E-Book | www.sack.de
E-Book

E-Book, Englisch, 240 Seiten

Kossak / Illibauer / Geist A Rigorous Semantics for BPMN 2.0 Process Diagrams


2014
ISBN: 978-3-319-09931-6
Verlag: Springer Nature Switzerland
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 240 Seiten

ISBN: 978-3-319-09931-6
Verlag: Springer Nature Switzerland
Format: PDF
Kopierschutz: 1 - PDF Watermark



This book provides the most complete formal specification of the semantics of the Business Process Model and Notation 2.0 standard (BPMN) available to date, in a style that is easily understandable for a wide range of readers - not only for experts in formal methods, but e.g. also for developers of modeling tools, software architects, or graduate students specializing in business process management.BPMN - issued by the Object Management Group - is a widely used standard for business process modeling. However, major drawbacks of BPMN include its limited support for organizational modeling, its only implicit expression of modalities, and its lack of integrated user interaction and data modeling. Further, in many cases the syntactical and, in particular, semantic definitions of BPMN are inaccurate, incomplete or inconsistent. The book addresses concrete issues concerning the execution semantics of business processes and provides a formal definition of BPMN process diagrams, which can serve as a sound basis for further extensions, i.e., in the form of horizontal refinements of the core language.To this end, the Abstract State Machine (ASMs) method is used to formalize the semantics of BPMN. ASMs have demonstrated their value in various domains, e.g. specifying the semantics of programming or modeling languages, verifying the specification of the Java Virtual Machine, or formalizing the ITIL change management process.This kind of improvement promotes more consistency in the interpretation of comprehensive models, as well as real exchangeability of models between different tools. In the outlook at the end of the book, the authors conclude with proposing extensions that address actor modeling (including an intuitive way to denote permissions and obligations), integration of user-centric views, a refined communication concept, and data integration.

The authors are experienced industrial researchers in the field of computer science and software engineering, with experience in business process modelling and formal methods in particular. They have been working in a joint team from the Software Competence Center Hagenberg (SCCH) and the Institute for Application Oriented Knowledge Processing (FAW) of the Johannes Kepler University Linz (JKU), both in Austria.

Kossak / Illibauer / Geist A Rigorous Semantics for BPMN 2.0 Process Diagrams jetzt bestellen!

Weitere Infos & Material


1;Preface;6
2;Contents;8
3;1 Introduction;12
3.1;1.1 Motivation;13
3.2;1.2 Intended Readership and Relevance;18
3.3;1.3 Outline;19
4;2 State of the Art;20
4.1;2.1 An Overview of Business Process Modelling Techniques;20
4.2;2.2 Formal Representations of BPMN;22
4.3;2.3 Suitability of BPMN for Business Process Modelling;24
5;3 Modelling Semantics with Abstract State Machines;28
5.1;3.1 General Features of the ASM Method;29
5.2;3.2 The ASM Notation Used in This Book;33
5.2.1;3.2.1 Rules;33
5.2.2;3.2.2 Derived Functions;35
5.2.3;3.2.3 Local Constants and Variables and New DataElements;35
5.2.4;3.2.4 Assertions;36
5.2.5;3.2.5 Types of Functions and Universes;36
5.2.6;3.2.6 Signatures of Functions and Rules;37
5.2.7;3.2.7 Boolean Expressions;37
5.2.8;3.2.8 Set Expressions;38
5.2.9;3.2.9 Naming Conventions;38
6;4 A Rigorous Semantics for BPMN 2.0 Process Diagrams;40
6.1;4.1 Process Diagrams;41
6.2;4.2 Framework;44
6.2.1;4.2.1 Initialisation and Top-Level Process Management;44
6.2.2;4.2.2 Workflow Transition Interpreter;45
6.2.2.1;4.2.2.1 Token Concept;46
6.2.3;4.2.3 Flow Nodes;47
6.2.3.1;4.2.3.1 Node Transition;49
6.2.3.2;4.2.3.2 Instance Transition;51
6.2.3.3;4.2.3.3 Process vs. Activity;51
6.3;4.3 Control Flow;53
6.3.1;4.3.1 Producing Tokens;54
6.3.2;4.3.2 Consuming Tokens;54
6.4;4.4 Instantiation, Deletion, and Interruption;55
6.4.1;4.4.1 Creating Instances;55
6.4.2;4.4.2 Deleting Instances;56
6.4.3;4.4.3 Interrupting Activities;57
6.5;4.5 Activities;60
6.5.1;4.5.1 Send Tasks and Receive Tasks;62
6.5.2;4.5.2 Common Semantics of Activities;63
6.5.3;4.5.3 Tasks;67
6.5.4;4.5.4 Sub-processes;71
6.5.5;4.5.5 Event Sub-processes;74
6.5.6;4.5.6 Transaction Sub-processes;75
6.5.7;4.5.7 Ad Hoc Sub-processes;78
6.5.8;4.5.8 Compensation;80
6.5.8.1;4.5.8.1 Rules Concerning Compensation;81
6.5.8.2;4.5.8.2 Functions Concerning Compensation;82
6.5.9;4.5.9 Call Activities;82
6.5.10;4.5.10 Loop Activities;84
6.5.10.1;4.5.10.1 Standard Loop;88
6.5.10.2;4.5.10.2 Sequential Multi-instance Loop;90
6.5.10.3;4.5.10.3 Parallel Multi-instance Loop;92
6.6;4.6 Gateways;94
6.6.1;4.6.1 Parallel Gateways;97
6.6.2;4.6.2 Exclusive Gateways;99
6.6.3;4.6.3 Inclusive Gateways;101
6.6.4;4.6.4 Complex Gateways;107
6.6.5;4.6.5 Event-Based Gateways;113
6.7;4.7 Events;117
6.7.1;4.7.1 Event Transition;119
6.7.2;4.7.2 Catching Events;119
6.7.3;4.7.3 Start Events;124
6.7.4;4.7.4 Start Events of Top-Level Processes;126
6.7.5;4.7.5 Start Events of Embedded Sub-processes;133
6.7.6;4.7.6 Start Events of Event Sub-processes;134
6.7.7;4.7.7 Boundary Start Events;139
6.7.8;4.7.8 Intermediate Catching Events;142
6.7.9;4.7.9 Catching Link Events;145
6.7.10;4.7.10 Intermediate Boundary Events;147
6.7.11;4.7.11 Throwing Events;151
6.7.12;4.7.12 End Events;154
6.7.13;4.7.13 Intermediate Throwing Events;155
6.7.14;4.7.14 Throw a Compensation Event;156
6.7.14.1;4.7.14.1 Throw an Exception;158
6.8;4.8 Data;159
6.9;4.9 Miscellaneous;161
6.9.1;4.9.1 Scope;161
6.9.2;4.9.2 Message Flow;161
6.9.3;4.9.3 Swimlanes;162
6.9.4;4.9.4 Artefacts;163
6.9.5;4.9.5 Conversation;163
6.9.6;4.9.6 Correlation;163
6.9.7;4.9.7 Choreography;163
7;5 How the Semantic Model Can Be Used;164
7.1;5.1 Validation and Verification;165
7.2;5.2 Validation;166
7.3;5.3 Verification;169
8;6 A Discussion of BPMN 2.0;171
8.1;6.1 General Remarks on BPMN;172
8.2;6.2 Deviations Between Our Model and the BPMN 2.0 Standard;175
8.2.1;6.2.1 Conflicting Provisions in the Standard;175
8.2.2;6.2.2 Superfluous Elements;176
8.3;6.3 Suggestions for Further Improvements;177
8.3.1;6.3.1 Potential for Semantic Simplification;177
8.3.2;6.3.2 Process Instantiation by Mixed-Behaviour Elements;178
8.3.3;6.3.3 Other Mixed-Behaviour Elements and Further Possible Simplifications;181
8.3.4;6.3.4 Object-Oriented vs. Subject-Oriented Approaches;182
8.3.5;6.3.5 Modelling Issues Currently not Covered by BPMN;183
9;7 Towards a Workflow Engine by Stepwise Refinement;184
9.1;7.1 Workflow Interpreter (WI);184
9.2;7.2 Context;186
9.2.1;7.2.1 Static Context;186
9.2.2;7.2.2 Root Context;187
9.2.3;7.2.3 Sub-context;187
9.3;7.3 Notifications;188
9.4;7.4 Implicit Notifications;190
9.5;7.5 Message and Signal Pool;191
9.6;7.6 Event Publication;192
9.7;7.7 Event Propagation;193
9.8;7.8 Deployment Manager and Deployments;194
9.8.1;7.8.1 Deployments;194
9.8.2;7.8.2 Deployment Manager;195
9.9;7.9 Instance Manager;196
9.10;7.10 Further Refinements;198
10;8 Discussion of the Proposed Specification and Outlook;199
10.1;8.1 Deontic BPMN;200
10.2;8.2 A Layered Approach for Actor Modelling;201
10.3;8.3 Integration of User Interaction Modelling;202
10.4;8.4 Towards an Enhanced Communication Concept;203
10.5;8.5 Integration of Data Modelling;204
10.6;8.6 Towards an eP2 Architecture;205
11;A The Signature of the Ground Model;206
11.1;A.1 Auxiliary Functions and Constructs Used;206
11.2;A.2 Basic Functions (Signature);208
11.2.1;A.2.1 Primitive Types;208
11.2.2;A.2.2 Universes;209
11.2.2.1;A.2.2.1 Regarding Flow Nodes and Connecting Objects;210
11.2.2.2;A.2.2.2 Regarding Lifecycle States;211
11.2.2.3;A.2.2.3 Regarding Event Triggers;212
11.2.3;A.2.3 Static Functions;214
11.2.3.1;A.2.3.1 Regarding Processes;214
11.2.3.2;A.2.3.2 Regarding Flow Nodes;215
11.2.3.3;A.2.3.3 Regarding Event Definitions;219
11.2.3.4;A.2.3.4 Regarding Connecting Objects;219
11.2.3.5;A.2.3.5 Regarding Data;220
11.2.4;A.2.4 Shared Functions;220
11.2.5;A.2.5 Monitored Functions;221
11.2.6;A.2.6 Controlled Functions;222
11.2.6.1;A.2.6.1 Regarding Instances;222
11.2.6.2;A.2.6.2 Regarding Flow Nodes;223
11.2.6.3;A.2.6.3 Regarding Connecting Objects;223
11.2.6.4;A.2.6.4 Regarding Tokens;224
11.2.6.5;A.2.6.5 Regarding Event Triggers;224
12;B List of Acronyms;225
13;C BPMN Symbols;227
14;References;229
15;Index;238



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.