03.12.2012 Views

xoEPC - Jan Mendling

xoEPC - Jan Mendling

xoEPC - Jan Mendling

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

3.4. EPC Semantics 53<br />

a decision has to be made: whether to perform it in every process instance during run<br />

time (ON), or whether to exclude it permanently (OFF), i.e. it will not be executed in any<br />

process instance, or whether to defer this decision to run time (OPT), i.e. for each process<br />

instance, it has to be decided whether to execute the function or not. Configurable con-<br />

nectors subsume build-time connector types that are less or equally expressive. Hence,<br />

a configurable connector can only be configured to a connector type that restricts its<br />

behavior. A configurable OR-connector may be mapped to a regular OR-, XOR-, AND-<br />

connector, or to a single sequence of events and functions (indicated by SEQn for some<br />

process path starting with node n). A configurable AND-connector may only be mapped<br />

to a regular AND-connector. A configurable XOR-connector may be mapped to a regular<br />

XOR-connector or to a single sequence SEQn. Interdependencies between configurable<br />

EPC nodes can be specified via configuration requirements, i.e. logical expressions that<br />

define constraints for inter-related configuration nodes. Configuration guidelines formal-<br />

ize recommendations and best practices (also in the form of logical expressions) in order<br />

to support the configuration process semantically. Additional work formalizes C-EPC<br />

syntax [RA07], its mapping to EPCs [MRRA06], and its identification from existing sys-<br />

tems [JVAR06].<br />

3.4 EPC Semantics<br />

In addition to related work on the syntax of EPCs, there are several contributions towards<br />

the formalization of EPC semantics. This section first illustrates the semantical problems<br />

related to the OR-join. Then it gives a historical overview of semantical definitions, and<br />

provides a formalization for EPCs, that is used in this thesis. Furthermore, we present<br />

an implementation of these semantics as a ProM plug-in that generates the reachability<br />

graph for a given EPC.<br />

3.4.1 Informal Semantics as a Starting Point<br />

Before discussing EPC formalization problems, we need to establish an informal un-<br />

derstanding of state representation and state changes of an EPCs. Although we provide

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!