TY  - GEN
A1  - Pufahl, Luise
A1  - Wong, Tsun Yin
A1  - Weske, Mathias
T1  - Design of an extensible BPMN process simulator
T2  - Business Process Management Workshops (BPM 2017)
N2  - Business process simulation is an important means for quantitative analysis of a business process and to compare different process alternatives. With the Business Process Model and Notation (BPMN) being the state-of-the-art language for the graphical representation of business processes, many existing process simulators support already the simulation of BPMN diagrams. However, they do not provide well-defined interfaces to integrate new concepts in the simulation environment. In this work, we present the design and architecture of a proof-of-concept implementation of an open and extensible BPMN process simulator. It also supports the simulation of multiple BPMN processes at a time and relies on the building blocks of the well-founded discrete event simulation. The extensibility is assured by a plug-in concept. Its feasibility is demonstrated by extensions supporting new BPMN concepts, such as the simulation of business rule activities referencing decision models and batch activities.
KW  - Business process simulation
KW  - Extensibility
KW  - BPMN
Y1  - 2018
SN  - 978-3-319-74030-0
SN  - 978-3-319-74029-4
U6  - https://doi.org/10.1007/978-3-319-74030-0_62
SN  - 1865-1348
VL  - 308
SP  - 782
EP  - 795
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Weiher, Marcel
A1  - Hirschfeld, Robert
T1  - Polymorphic identifiers: uniform resource access in objective-smalltalk
JF  - ACM SIGPLAN notices
N2  - In object-oriented programming, polymorphic dispatch of operations decouples clients from specific providers of services and allows implementations to be modified or substituted without affecting clients.
 The Uniform Access Principle (UAP) tries to extend these qualities to resource access by demanding that access to state be indistinguishable from access to operations. Despite language features supporting the UAP, the overall goal of substitutability has not been achieved for either alternative resources such as keyed storage, files or web pages, or for alternate access mechanisms: specific kinds of resources are bound to specific access mechanisms and vice versa. Changing storage or access patterns either requires changes to both clients and service providers and trying to maintain the UAP imposes significant penalties in terms of code-duplication and/or performance overhead.
 We propose introducing first class identifiers as polymorphic names for storage locations to solve these problems. With these Polymorphic Identifiers, we show that we can provide uniform access to a wide variety of resource types as well as storage and access mechanisms, whether parametrized or direct, without affecting client code, without causing code duplication or significant performance penalties.
KW  - Identifiers
KW  - REST
KW  - Uniform Access Principle
KW  - Extensibility
Y1  - 2014
U6  - https://doi.org/10.1145/2508168.2508169
SN  - 0362-1340
SN  - 1558-1160
VL  - 49
IS  - 2
SP  - 61
EP  - 71
PB  - Association for Computing Machinery
CY  - New York
ER  -