EPC Modelling based on Implicit Arc Types
|
|
- Brooke Allison
- 7 years ago
- Views:
Transcription
1 EPC Modelling based on Implicit Arc Types Jan Mendling, Markus Nüttgens Universität Trier Wirtschaftsinformatik II, Postfach 3825, D Trier Abstract: Event Driven Process Chains (EPC) are commonly used for the modelling of business processes. As modelling is decentralised to personnel not familiar with the formal aspects of this method, syntax checks are needed to avoid invalid models. This paper presents the concept of implicit element and arc types. It can be used both to support modellers in the process of building models and to check entire models. It is especially helpful to avoid closure calculation for connector type consistency constraints. 1. EPC and Business Process Modelling 1.1. Modelling with EPC between Intuition and Validity Event Driven Process Chains (EPC) have been developed to model business processes on a conceptual level [KNS92]. Both in academics as integral part of the ARIS concept [Sc00] and in practice with SAP AG using them for their SAP reference model [Ke99], they have reached a wide-spread use. A major advantage of EPCs is their ability to express processes in an intuitive way. Thus, they are very often used for the documentation and management of business processes. Despite their popularity and intuition, the syntax of EPCs has to meet a variety of validity rules concerning the sequence of different elements. This turns out to be a problem when organizations decentralize and delegate their business process modelling activities to the departments concerned. On the one hand, the personnel involved might be little experienced in assessing the formal validity of the models they produce. One the other hand, models have to be valid in order to be reused in workflow management systems. As a consequence two questions arise: Firstly, which concepts can be used to guide the modeller during the process of modelling to avoid syntactically invalid modelling. Secondly, how can the validity of a given EPC model checked in an efficient way. This paper addresses these two problems and presents a concept called implicit arc types as a solution. Mendling, Jan; Nüttgens, Markus: EPC Modelling based on Implicit Arc Types. In: Godlevsky, Mikhail; Liddle, Stephen W.; Mayr, Heinrich C. (Eds.): Information Systems Technology and its Applications, International Conference ISTA'2003, June 19-21, 2003, Kharkiv, Ukraine, Proceedings. LNI 30 GI 2003, ISBN , pp
2 1.2. EPC Syntax Related Work Most of the formal contributions on EPCs have been focused on semantics, especially on the semantics of OR connectors. The translation of EPC process models to Petri Nets plays an important role in this context. Examples of this research can be found in Chen/Scheer [CS94], Rodenhagen [Ro97], Langner/Schneider/Wehler [LSW98], van der Aalst [Aa99], Rittgen [Ri00], and Dehnert [De02]. A major point of discussion is the non-locality of join-connectors [ADK02]. This paper will present a syntax related work based on the formal syntax definition of EPCs in [NR02]. Therefore we give a brief survey of syntax related work before presenting definitions in the second section. In Keller/Nüttgens/Scheer the EPC is introduced [KNS92] to represent temporal and logical dependencies in business processes. Elements of EPCs may be of function type (active elements), event type (passive elements), or of one of the three connector types AND, OR, or XOR. These objects are linked via control flow arcs. Connectors may be split or join operators, starting either with function(s) or event(s). These four combinations are discussed for the three connectors resulting in twelve possibilities. Split OR and Split XOR are prohibited after events, due to the latter being unable to decide which following functions to choose. Based on practical experience with the SAP Reference model, process interfaces and hierarchical functions are introduced as additional element types of EPCs [KM94]. These two elements permit to link different EPC models: process interfaces can be used to refer from the end of a process to a following process, hierarchical functions allow to define macro-processes with the help of sub-processes. Keller [Ke99] and Rump [99] provide a formal approach defining the EPC syntax. Based on this, Nüttgens/Rump [NR02] distinguish the concepts of a flat EPC Schema and a hierarchical EPC Schema. A flat EPC Schema is defined as a directed and coherent graph with cardinality and type constraints. A hierarchical EPC Schema is a set of flat or hierarchical EPC Schemata. Hierarchical EPC Schemata consist of flat EPC Schemata and a hierarchy relation linking either a function or a process interface to another EPC Schema. Fig. 1 shows a hierarchical EPC Schema consisting of two processes, which are linked via a hierarchical relation attached to the process interface To Design Process. Type consistency of consecutive connectors poses a major problem for these definitions, because the EPC graph has to be traversed to find and check all non-connector ancestors and descendant elements. In section two we will introduce explicit and implicit element and arc types, and define EPCs with the help of them. The advantages of such a definition are presented in section three, where it is described how formally valid business process modelling with EPCs can be granted.
3 EPC Symbols Requirements Engineering Design Process Event Function Start From Requirements Engineering Process Interface List requirements Can be fulfilled Connectors Control Flow Arc Cannot be fulfilled Can be fulfilled Design Design finished To Design Process Fig. 1. EPC example of a simple requirements engineering process. The connector represents an exclusive or. After Can be fulfilled a process interface links to the design process. 2. EPC Syntax Objects 2.1. Explicit and Implicit Element Types The distinction of explicit and implicit element types is rooted in two different perspectives on business process modelling, the perspective of the modeller and the perspective of verification. The task of the modeller is to compose a structure from a given set of symbols that is able to represent concepts of the domain in a pragmatic and abbreviated way. This set of symbols modelling is provided by a business process modelling tool. Such EPC symbols usually refer to the original definition of Keller/Nüttgens/Scheer [KNS92] distinguishing event type E, function type F, process interface P, connector AND, connector OR, and connector XOR. We refer to them as explicit element types EXPL being mutually disjoint: EXPL = E F P AND OR XOR. (1) Implicit element types relate to the perspective of syntactical verification. They represent disjoint specialisations of corresponding explicit element types. Each implicit element type captures a specific constellation in which an explicit element type may occur. Each of these implicit roles implies different restrictions on the set of allowed ancestors and descendants, and their cardinality. Fig. 2 presents explicit and corresponding implicit element types: Events E may be Start Events E S, Inner Event E Int or End Event E E. For process interfaces P can be used as start and end symbols. Connectors can be either joins
4 or splits. When they have (transitive) event ancestors, their (transitive) descendants have to be functions. When they have (transitive) function ancestors, their (transitive) descendants have to be events. For OR- and XOR-connectors Event-Function-Splits are forbidden [KNS92]. Explicit Element Type Event E Function F Process Interface P Connector AND Connector OR Connector XOR Implicit Element Types Start Event E S Inner Event E Int End Event E E Function F Start ProcessInterface P S End ProcessInterface P E Event-Function-Split AND EFS Event-Function-Join AND EFJ Function-Event-Split AND FES Function-Event-Join AND FEJ Event-Function-Join OR EFJ Function-Event-Split OR FES Function-Event-Join OR FEJ Event-Function-Join XOR EFJ Function-Event-Split XOR FES Function-Event-Join XOR FEJ Fig. 2. Explicit and corresponding implicit element types Explicit and Implicit Arc Types Analogously to the distinction between explicit and implicit element types, we define implicit arc types as a partition of the control flow arc (explicit arc type) [Me03]. Implicit arc types are subsets of the product of implicit element types. Fig. 3 presents which arcs are allowed from and to implicit element types. The 16x16 matrix shows 100 implicit arc types which are permitted. The distribution of them in this matrix suggests the distinction between two different groups of implicit arcs. We will refer to them as Function-Event-Arcs FEA and Event-Function-Arcs EFA. In order to define these two kinds of arcs, a grouping of implicit element types into Event-Types (from), Function-Types (from), Event-Types (to), and Function-Types (to) is needed: Event Types (from) ET from = E S E Int AND EFS AND EFJ OR EFJ XOR EFJ, Function Types (from) FT from = F P S AND FES AND FEJ OR FES OR FEJ XOR FES XOR FEJ, (2) (3) Event Types (to) ET to = E Int E E AND EFS AND EFJ OR EFJ XOR EFJ, (4) Function Types (to) FT to = F P E AND EFS AND EFJ OR EFJ XOR EFJ. (5)
5 We can then define these two different implicit arc type groups as FEA (FT from x ET to ), (6) EFA (ET from x FT to ), (7) (left) TO (above) ES EInt EE FROM E S E Int E E F P S P E AND EFS AND EFJ AND FES AND FEJ OR EFJ OR FES OR FEJ XOR EFJ XOR FES XOR FEJ F PS PE ANDEFS Fig. 3. Implicit arc types are a subset of the product of implicit element types. The arcs in the grey cells are Function-Event-Arcs; those arcs in the white cells are Event-Function-Arcs. In the following, the definition of implicit arc type groups will be used in a redefinition of EPCs. The advantages of such a definition are presented in section four. ANDEFJ ANDFES ANDFEJ OREFJ ORFES ORFEJ XOREFJ XORFES XORFEJ
6 3. EPC Syntax Properties 3.1. Syntactical Constraints of Flat EPCs Before presenting the syntactical properties of flat EPCs we still need some more definitions. Apart from cardinality which is defined in a different way by using implicit arc types, we follow Nüttgens/Rump [NR02]. The antisymmetry constraint is added, just like the constraint of the graph having to be simple which cannot be controlled by cardinality constraints on connectors. Let E S, E Int, E E, F, P S, P E, AND EFS, AND EFJ, AND FES, AND FEJ, OR EFJ, OR FES, OR FEJ, XOR EFJ, XOR FES, XOR FEJ be sets of elements of the respective element types. Then a set of vertices V is V = E S E Int E E F P S P E AND EFS AND EFJ AND FES AND FEJ OR EFJ OR FES OR FEJ XOR EFJ XOR FES XOR FEJ with all the elements of the union being mutually disjoint. Referring to the definitions (6) and (7) a set of arcs A is defined as A = FEA EFA. (9) The precondition of a vertex is made up by the set of ancestor arcs written as v := {(x,v) A} with v,x V. (10) The postcondition of a vertex is defined as the set of descending arcs: v := {(v,x) A} with v,x V. (11) A cycle set C is a set of vertices building a cycle: C V = {v 1,v 2,v 3,..,v n } with v 1 = v 2, v 2 = v 3,, v n = v 1 (12) Then, a flat EPC Schema EPC flat = (V,A) has the following flat EPC properties: 1. EPC flat is a directed graph. 2. EPC flat is a simple graph forbidding reflexive arcs or multiple arcs between two vertices. 3. EPC flat is a coherent graph. 4. EPC flat is an antisymmetric graph. 5. Concerning cycles: C i V: C i (E Int F ). 6. The set of Events E = E S E Int E E. 7. The set of Functions F. Concerning vertices there are the following cardinality constraints: (8)
7 1. Start vertices: v E S P S : v = and v = End vertices: v E S P S : v = 1 and v =. 3. Inner Events: v E Int : v = 1 and v = Functions: v F: v = 1 and v = Splits: v AND EFS AND FES OR FES XOR FES : v = 1 and v > Joins: v AND EFJ AND FEJ OR EFJ OR FEJ XOR EFJ XOR FEJ : v > 1 and v = 1. Concerning vertex types the following type consistency constraints apply: 1. Start Events: v E S : v EFA. 2. Inner Events: v E Int : v FEA and v EFA. 3. End Events: v E E : v FEA. 4. Start ProcessInterface: v P S : v FEA. 5. End ProcessInterface: v P E : v EFA. 6. Function: v F: v EFA and v FEA. 7. Event-Function-Connects: v AND EFS AND EFJ OR EFJ XOR EFJ : v EFA and v EFA. 8. Function-Event-Connects: v AND FES AND FEJ OR FES OR FEJ XOR FES XOR FEJ : v FEA and v FEA Syntactical Constraints of Hierarchical EPCs Let v V be a vertex, x i NC = (E S E Int E E F P S P E ) and c i C = V (E S E Int E E F P S P E ) a connector, then the non-connector ancestor border NCAB v of v is a set of all vertices, which are transitive ancestors of v only via connectors: NCAB v = {x 1,, x n }: x i NC: n i N and c ij C: x i = c i1, c i1 = c i2,, c ini = v (14) and the non-connector descendant border NCDB v of v is defined as: NCDB v = {x 1,, x n }: x i NC: n i N and c ij C: v = c i1, c i1 = c i2,, c ini = x i (15) Let EPC Set be a set of EPC Schemata EPC Set = {S 1,, S n }, (16) then a hierarchical EPC Schema EPC hier is defined as EPC hier = (V,A,H) (17) with H being a hierarchy relation linking a ProcessInterface or a function to another EPC Schema:
8 H (F P E ) x EPC Set with (F P E ) V (18) An EPC Schema Set is an EPC Set for which holds: EPC Schema = {S 1,, S n } (19) fulfilling the condition: S i EPC Schema : S i = (V i,a i,h i ) with H i (F i P Ei ) x EPC Schema. (20) Let HC S EPC Schema then HC S is called the hierarchical closure on S with HC S = {S 1,,S n S i n i : (H i1 S Sch i1 H i1 ) (H i2 Sch i1 Sch i2 H i2 ) (H ini Sch ini-1 Sch in H in ) (Sch i1,,sch ini EPC Schema )} (21) A hierarchical EPC Schema has to meet the following hierarchy requirements: 1. S i EPC Schema : S i meets the conditions for a flat EPC Schema. 2. Cardinality H i : v P Ei : {A EPC Schema (v,a) H i } = Cardinality H i : v F i : {A EPC Schema (v,a) H i } Pre-Event-Consistency: v F i : (v,s i ) H i : NCAB v = {e i e i E S S i } 5. Post-Event-Consistency: v F i : (v,s i ) H i : NCDB v = {e i e i E E S i } 6. Pre-Event-Consistency: v P Ei : (v,s i ) H i : NCAB v = {e e, ps S i ps P S e E Int e = ps }. Due to our restriction on P S NCAB v = Post-Event-Consistency: v P Ei : (v,s i ) H i : NCDB v = {e e, pe S i pe P E e E Int e = pe}. Due to our restriction on P E NCDB v = Recursion prohibited: S i EPC Schema : S i HC Si Syntactical Constraints of Arcs In section four EPC syntax checks are discussed. We will refer to the EPC syntactical constraints as Flat 1-8 for flat EPC Schema properties, Card 1-6 for cardinality constraints, Type 1-8 for type consistency constraints, and Hier 1-8 for hierarchy constraints. Here, we still need to mention constraints on arcs. Relating to our definition (2) - (5) of the different arc types, this seems redundant. But when it comes to model checking, implicit arc type groups will be a label on the respective arc which does not have to be consistent or valid. In that context there is a need to check if the types of the referenced vertices match the implicit arc type. Thus, we add Arc 1-2 to check arc consistency: 1. (x,y) FEA: x FT from and y ET to. 2. (x,y) EFA: x ET from and y FT to.
9 4. Using Implicit Arc Types for Validity Checks 4.1. Problems without Implicit Types Type Consistency of connectors has been a problem of former EPC definitions without implicit elements and arc types. When there is a path of successive connectors as in Fig. 4, transitive non-connector ancestor border NCAB v and descendant border NCDB v have to be determined. This involves costly traversing of the EPC graph. In the following paragraph, we describe how implicit element and arc types can lead to a better performance. In that context we distinguish guided modelling and model checking. Event 1 Event 2 Event 3 Event 4 Event 5 Function 1 Function 2 Function 3 Function 4 Function 5 Fig. 4. In order to check Type Consistency of the grey XOR-connector the transitive nonconnector ancestors and transitive non-connector descendants have to be determined Guided Modelling using Implicit Types Guided Modelling describes strategies to support the modeller in the process of building models in order to grant syntactically valid models. The definitions 6 and 7 concerning the two different implicit arc type groups can be used to determine conflicts when there is a new arc added to the model. It is assumed that the modeller uses symbols corresponding to explicit EPC element types. In order to take advantage of implicit types, we need a set of possible implicit element or arc types, referred to as, attached to every instance of an explicit EPC symbol. Modelling includes four elementary operations: the insertion of an explicit element and the insertion of an explicit control flow arc to the model; and the deletion of an element or an arc. Changes can be interpreted as a sequence of a deletion and an addition. In the following, we concentrate on insertions, because deletions work similar in the opposite way.
10 When there is an element inserted into the model, is instantiated with all of its implicit element types. The insertion of an arc affects the sets of possible implicit types of the start vertex of the arc S ; of the end vertex of the arc E ; and of the arc itself arc. In a first step, arc is determined by comparing E and S with the definitions of the two implicit arc type groups: E ET from S FT to EFA arc. (22) E FT from S ET to FEA arc. If there is Arc = {} after this first steps, the new arc is not valid, because type consistency is no longer granted. This invalid arc should then be deleted and a report be provided for the modeller. If Arc {}, then E and S need to be updated as a second step according to these rules: If Arc = {EFA, FEA}: E = E S = S (23) If Arc = {EFA}: E = E ET from S = S FT to If Arc = {FEA}: E = E FT from S = S ET to If Arc = {}: E = E S = S. As a third step, these recalculations must cascade from the updated vertices, because inconsistencies may appear transitively via connectors. Cycles do not pose a problem for termination, because is a finite set of maximum 16 elements. Each step can only involve a reduction of elements leading at least to a termination in terms of an empty set. This three-step algorithm helps to transform an EPC model from one type consistent state to another type consistent state. The operations from definition 22 and 23 may therefore be considered as an EPC model transaction granting validity Model Checking using Implicit Types The case of guided modelling demands extra features to be added to the business process modelling tool. The model checking approach does not require such capabilities. It takes a model composed of explicit element and arc type symbols as an input and determines the implicit type for each symbol. The use of implicit types avoids the calculation of the non-connector ancestor border NCAB v and descendant border NCDB v for each connector. The algorithm takes a list of symbols as an input, with each symbol being of one of the explicit element or arc types. The order of the symbols is arbitrary. It works in two steps. The first step is the hypothesis step: by checking the cardinality of the ancestors and descendants, the implicit types of Functions, Events and ProcessInterfaces are determined, and join connectors are distinguished from split connectors. If an unexpected constellation appears the implicit type is set to invalid. For arcs and connectors, we do not calculate the non-connector ancestor border, but follow only one path until we reach a non-connector element. If this is an Event, the arc is set to the implicit type EFA and
11 the connector to a EventFunctionJoin or Split. This hypothesis generated by only looking at one (transitive) ancestor can have two consequences: firstly, the hypothesis is correct, or the there is a type inconsistency. It is not possible that another hypothesis is correct. The second step is the confirmation step. The generated list of symbols labelled with implicit types is taken as an input. Now, for all elements and arcs type consistency can be checked only by looking at the ancestor and descendant arc for implicit element types or the start and the end vertex for implicit arc types. An expansion of vertices is no longer needed. 5. Conclusion and Future Work This paper has addressed the validity of EPC business process models. As process modelling becomes more and more decentralised in organisations, non-professional modellers need tools to assist them to produce high quality models in terms of syntactical validity. The concept of implicit element and arc types gives a transparent answer to the question of valid EPC syntax. Validity of connectors can be check only by looking at the implicit arc type group of the ancestor and descendant arcs. Additionally, the implicit complexity of EPCs as a modelling technique is revealed. Nevertheless, pre- and postevent-consistency and the recursion prohibition (Hier 4-8) of hierarchical EPC Schemas still need closures to be calculated in order to check validity. The next step will be an XSLT based syntax check for models stored in EPC Markup Language (EPML) [MN02]. References [ADK02] [Aa99] [CS94] [De02] [Ke99] [KM94] van der Aalst, W.; Desel, J.; Kindler, E.: On the semantics of EPCs: A vicious circle, in: Nüttgens, M.; Rump, F.J. (eds.): Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten - EPK 2002, Proceedings of the GI-Workshop EPK 2002, Trier, 2002, pp van der Aalst, W.M.P.: Formalization and Verification of Event-driven Process Chains, in: Information and Software Technology 41(1999)10, pp Chen, R.; Scheer, A.-W.: Modellierung von Prozessketten mittels Petri-Netz-Theorie, in: Scheer, A.-W. (ed.): Publications of the Institut für Wirtschaftsinformatik, No. 107, Saarbrücken Dehnert, J.: Making EPC s fit for Workflow Management, in: Nüttgens, M.; Rump, F.J. (eds.): Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten - EPK 2002, Proceedings of the GI-Workshop EPK 2002, Trier, 2002, pp Keller, G. & Partner: SAP/ R3 prozeßorientiert anwenden. Iteratives Prozeß- Prototyping mit Ereignisgesteuerten Prozeßketten und Knowledge Maps, Bonn et al Keller, G.; Meinhardt, S.: DV-gestützte Beratung bei der SAP-Softwareeinführung, in: HMD 31(1994)175, pp
12 [KNS92] [LSW98] [Me03] [MN02] [NR02] [Ri00] [Ro97] [Ru99] [Sc00] Keller, G.; Nüttgens, M.; Scheer, A.-W.: Semantische Prozeßmodellierung auf der Grundlage Ereignisgesteuerter Prozeßketten (EPK). In: Scheer, A.-W. (Hrsg.): Veröffentlichungen des Instituts für Wirtschaftsinformatik, Heft 89, Saarbrücken, Langner, P.; Schneider, C.; Wehler, J.: Petri Net Based Certification of Event driven Process Chains, in: Desel, J.; Silva, M. (eds.): Application and Theory of Petri Nets 1998, LNCS Vol. 1420, Springer, Berlin et. al. 1998, pp Mendling, J.: Event-Driven-Process-Chain-Markup-Language (EPML): Anforderungen, Konzeption und Anwendung eines XML-Schemas für Ereignisgesteuerte Prozessketten (EPK), in: Höpfner, H.; Saake, G.: Proceedings of the Student Program of the 10th Conference Database Systems for Business, Technology and Web, GI Section Databases and Information Systems, Leipzig, , Madgeburg, 2003, pp Mendling, J.; Nüttgens, N.: Event-Driven-Process-Chain-Markup-Language (EPML): Anforderungen zur Definition eines XML-Schemas für Ereignisgesteuerte Prozessketten (EPK), Proceedings of the GI-Workshop EPK 2002, Trier, 2002, pp Nüttgens, M.; Rump, F.: Syntax und Semantik Ereignisgesteuerter Prozessketten (EPK), in: Prozessorientierte Methoden und Werkzeuge für die Entwicklung von Informationssystemen (Promise 2002), Hasso-Plattner-Institut für Softwaresystemtechnik an der Universität Potsdam, Oktober 2002, Potsdam Rittgen, P.: Paving the Road to Business Process Automation, European Conference on Information Systems (ECIS) 2000, Vienna, Austria, July 3-5, 2000, pp Rodenhagen, J.: Darstellung ereignisgesteuerter Prozeßketten (EPK) mit Hilfe von Petrinetzen, Diplomarbeit Universität Hamburg Fachbereich Informatik (Prof. Valk), Hamburg Rump, F.: Geschäftsprozeßmanagement auf der Basis ereignisgesteuerter Prozeßketten - Formalisierung, Analyse und Ausführung von EPKs, Teubner, Stuttgart et al Scheer, A.-W.: ARIS Business Process Modeling, 3rd edition, Springer, Berlin et. al
1 Business Modeling. 1.1 Event-driven Process Chain (EPC) Seite 2
Business Process Modeling with EPC and UML Transformation or Integration? Dr. Markus Nüttgens, Dipl.-Inform. Thomas Feld, Dipl.-Kfm. Volker Zimmermann Institut für Wirtschaftsinformatik (IWi), Universität
More informationPaving the Road to Business Process Automation
Paving the Road to Business Process Automation P. Rittgen University Koblenz-Landau Rheinau 1 Koblenz, 56075 Germany Abstract- Event-driven Process Chains (EPCs) have been helped to achieve an important
More informationEMC A MODELING METHOD FOR DEVELOPING WEB- BASED APPLICATIONS
EMC A MODELING METHOD FOR DEVELOPING WEB- BASED APPLICATIONS Peter Rittgen Institute of Business Informatics, University Koblenz-Landau, Rheinau 1, D-56075 Koblenz email: rittgen@uni-koblenz.de, phone:
More information... Chair of Mobile Business & Multilateral Security. Lecture 13 Business Informatics 2 (PWIN) Business Process Reengineering (BPR) SS 2015
Lecture 13 Business Informatics 2 (PWIN) Business Process Reengineering (BPR) SS 2015 Prof. Dr. Kai Rannenberg www.m-chair.de Chair of Mobile Business & Multilateral Security Jenser (Flickr.com) Business
More informationStructural Detection of Deadlocks in Business Process Models
Structural Detection of Deadlocks in Business Process Models Ahmed Awad and Frank Puhlmann Business Process Technology Group Hasso Plattner Institut University of Potsdam, Germany (ahmed.awad,frank.puhlmann)@hpi.uni-potsdam.de
More informationOn Ontology-based Event-driven Process Chains
On Ontology-based Event-driven Process Chains Christian Fillies & Dr. Frauke Weichhardt Semtation GmbH Abstract Event driven process chains (EPC) have become an established industry standard since a decade.
More informationEXTENDING BUSINESS PROCESS MODELING TOOLS WITH WORKFLOW PATTERN REUSE
EXTENDING BUSINESS PROCESS MODELING TOOLS WITH WORKFLOW PATTERN REUSE Lucinéia Heloisa Thom 1, Jean Michael Lau 1, Cirano Iochpe 1,2, Jan Mendling 3 1 Institute of Informatics, Federal University of Rio
More informationTransformation of BPEL Processes to EPCs
Transformation of BPEL Processes to EPCs Jan Mendling 1, Jörg Ziemann 2 1 Vienna University of Economics and Business Administration, Austria jan.mendling@wu-wien.ac.at 2 Institute for Information Systems,
More informationTowards an Integration of Business Process Modeling and Object-Oriented Software Development
Towards an Integration of Business Process Modeling and Object-Oriented Software Development Peter Loos, Peter Fettke Chemnitz Univeristy of Technology, Chemnitz, Germany {loos peter.fettke}@isym.tu-chemnitz.de
More informationDiagramming Techniques:
1 Diagramming Techniques: FC,UML,PERT,CPM,EPC,STAFFWARE,... Eindhoven University of Technology Faculty of Technology Management Department of Information and Technology P.O. Box 513 5600 MB Eindhoven The
More informationWorkflows in UML. Peter Rittgen
Workflows in UML Peter Rittgen University College of Borås, 501 90 Borås, Sweden, phone: +46 33 16 5930, fax: +46 33 16 4007 E-mail: peter.rittgen@hb.se ABSTRACT UML Activity Diagrams have been studied
More informationInstantiation Semantics for Process Models
Instantiation Semantics for Process Models Gero Decker 1 and Jan Mendling 2 1 Hasso-Plattner-Institute, University of Potsdam, Germany gero.decker@hpi.uni-potsdam.de 2 Queensland University of Technology,
More informationMethods for the specification and verification of business processes MPB (6 cfu, 295AA)
Methods for the specification and verification of business processes MPB (6 cfu, 295AA) Roberto Bruni http://www.di.unipi.it/~bruni 19 - Event-driven process chains 1 Object We overview EPC and the main
More informationTransformation of Use Cases to EPC Models
Transformation of Use Cases to EPC Models Daniel Lübke Leibniz Universität Hannover, FG Software Engineering daniel.luebke@inf.uni-hannover.de Abstract: Within the requirements phase of many projects,
More informationE-Commerce Software: From Analysis to Design
E-Commerce Software: From Analysis to Design Peter Rittgen Institute of Business Informatics, University Koblenz-Landau, Koblenz, Germany ABSTRACT Early information systems were mainly built around secondary,
More informationTHE DIAGNOSIS OF INFORMATION POTENTIAL OF SELECTED BUSINESS PROCESS MODELLING NOTATIONS
INFORMATION SYSTEMS IN MANAGEMENT Information Systems in Management (2015) Vol. 4 (1) 26 38 THE DIAGNOSIS OF INFORMATION POTENTIAL OF SELECTED BUSINESS PROCESS MODELLING NOTATIONS RENATA GABRYELCZYK a),
More informationExtending UML 2 Activity Diagrams with Business Intelligence Objects *
Extending UML 2 Activity Diagrams with Business Intelligence Objects * Veronika Stefanov, Beate List, Birgit Korherr Women s Postgraduate College for Internet Technologies Institute of Software Technology
More informationAn Evaluation of Conceptual Business Process Modelling Languages
An Evaluation of Conceptual Business Process Modelling Languages Beate List Women's Postgraduate College for Internet Technologies Institute of Software Technology and Interactive Systems Vienna University
More informationAn Evaluation of Conceptual Business Process Modelling Languages
An Evaluation of Conceptual Business Process Modelling Languages Beate List and Birgit Korherr Women s Postgraduate College for Internet Technologies Institute of Software Technology and Interactive Systems
More information7. Classification. Business value. Structuring (repetition) Automation. Classification (after Leymann/Roller) Automation.
7. Classification Business Process Modelling and Workflow Management Business value Lecture 4 (Terminology cntd.) Ekkart Kindler kindler@upb.de Structuring (repetition) Automation UPB SS 2006 L04 2 Classification
More informationWorkflow Patterns for Business Process Modeling
Workflow Patterns for Business Process Modeling Lucinéia Heloisa Thom 1, Cirano Iochpe 1,2, Manfred Reichert 3 1 Federal University of Rio Grande do Sul, Informatics Institute, Av. Bento Gonçalves, 9500,
More informationFrom Business Process Modeling to the Specification of Distributed Business Application Systems - An Object-Oriented Approach -
From Business Process Modeling to the Specification of Distributed Business Application Systems - An Object-Oriented Approach - Otto K. Ferstl, Elmar J. Sinz 1 Abstract A business application system is
More informationConfigurable Reference Modeling Languages
Configurable Reference Modeling Languages Jan Recker 1), Michael Rosemann 1), Wil van der Aalst 1,2), Monique Jansen-Vullers 2), Alexander Dreiling 3) 1) Faculty of Information Technology Queensland University
More informationDetermination of the normalization level of database schemas through equivalence classes of attributes
Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,
More informationSoftware Construction
Software Construction Staff Faculty: Univ.-Prof. Dr. rer. nat. Horst Lichter lichter@informatik.rwth-aachen.de Secretary: Bärbel Kronewetter Phone: +49 241 80 21 330 Fax: +49 241 80 22 352 Research Assistants:
More informationARIS Architecture and Reference Models for Business Process Management
ARIS Architecture and Reference Models for Business Process Management August-Wilhelm Scheer, Markus Nüttgens Institut für Wirtschaftsinformatik, Universität des Saarlandes, Im Stadtwald Geb. 14.1, D-66123
More informationModelling and Verification of Business Processes
Modelling and Verification of Business Processes Costin Bădică Department of Computer Science King s College London, WC2R 2LS, UK badica@dcs.kcl.ac.uk Chris Fox Department of Computer Science University
More informationSemantic Analysis of Flow Patterns in Business Process Modeling
Semantic Analysis of Flow Patterns in Business Process Modeling Pnina Soffer 1, Yair Wand 2, and Maya Kaner 3 1 University of Haifa, Carmel Mountain 31905, Haifa 31905, Israel 2 Sauder School of Business,
More informationComputer Support for Agile Human-to-Human Interactions with Social Protocols
Computer Support for Agile Human-to-Human Interactions with Social Protocols Willy Picard Poznań University of Economics, Department of Information Technologies, ul. Mansfelda 4, Poznań, Poland Willy.Picard@ue.poznan.pl,
More informationTechnische Berichte Nr. 11 des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsdam
HASSO - PLATTNER - INSTITUT für Softwaresystemtechnik an der Universität Potsdam Requirements for Service Composition Harald Meyer Dominik Kuropka Technische Berichte Nr. 11 des Hasso-Plattner-Instituts
More informationBridging the Gap between Data Warehouses and Business Processes
Bridging the Gap between Data Warehouses and Business Processes A Business Intelligence Perspective for Event-Driven Process Chains Veronika Stefanov 1 and Beate List 1 Women s Postgraduate College for
More informationGOZINTOGRAPHS FOR BY-PRODUCTS AND CYCLIC PRODUCTION: AN APPROACH FOR ERP SYSTEM APPLICATION
GOZINTOGRAPHS FOR BY-PRODUCTS CYCLIC PRODUCTION: AN APPROACH FOR ERP SYSTEM APPLICATION Peter Loos Chemnitz University of Technology loos@isym.tu-chemnitz.de Abstract Cyclic production, which is distinctive
More informationLecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
More informationSoftware Construction
Software Construction Staff Faculty: Univ.-Prof. Dr. rer. nat. Horst Lichter lichter@informatik.rwth-aachen.de Secretary: Bärbel Kronewetter Phone: +49 241 80 21 330 Fax: +49 241 80 22 352 Research Assistants:
More informationSyntax errors in the EPC diagrams of the integrated management system documents
Scientific Journals Maritime University of Szczecin Zeszyty Naukowe Akademia Morska w Szczecinie 2010, 24(96) pp. 111 117 2010, 24(96) s. 111 117 Syntax errors in the EPC diagrams of the integrated management
More informationOn the Choice Between Graph-Based and Block-Structured Business Process Modeling Languages
Institute of Architecture of Application Systems On the Choice Between Graph-Based and Block-Structured Business Process Modeling Languages Oliver Kopp, Daniel Martin, Daniel Wutke, Frank Leymann Institute
More informationFrom Workflow Design Patterns to Logical Specifications
AUTOMATYKA/ AUTOMATICS 2013 Vol. 17 No. 1 http://dx.doi.org/10.7494/automat.2013.17.1.59 Rados³aw Klimek* From Workflow Design Patterns to Logical Specifications 1. Introduction Formal methods in software
More informationCourse description. [insert your course of studies here (e.g. Information Systems )] [insert the name of the university you studied at]
Name of applicant: Course description [insert your name here] Blue colored text indicates areas where you have to add content Course of studies: University: Grade Average: [insert your course of studies
More informationModelling Workflow with Petri Nets. CA4 BPM PetriNets
Modelling Workflow with Petri Nets 1 Workflow Management Issues Georgakopoulos,Hornick, Sheth Process Workflow specification Workflow Implementation =workflow application Business Process Modelling/ Reengineering
More informationStructural Aspects of Business Process Diagram Abstraction
Structural spects of Business Process Diagram bstraction Sergey Smirnov Business Process Technology Group Hasso Plattner Institute at the University of Potsdam D-14482 Potsdam, Germany sergey.smirnov@hpi.uni-potsdam.de
More informationMapping from Business Processes to Requirements Specification
Extended abstract 1/5 Mapping from Business Processes to Requirements Specification Svatopluk Štolfa, Ivo Vondrák Department of Computer Science, VŠB - Technical University of Ostrava, 17.listopadu 15,
More informationAn Approach to Business Process Modeling Emphasizing the Early Design Phases
An Approach to Business Process Modeling Emphasizing the Early Design Phases Sebastian Mauser, Robin Bergenthum, Jörg Desel, Andreas Klett Department of Applied Computer Science, Catholic University of
More informationUML Metamodel-based Workflow Modeling and Execution
UML Metamodel-based Workflow Modeling and Execution Jens Brüning University of Rostock Department of Computer Science D-18059 Rostock, Germany jens.bruening@uni-rostock.de Martin Gogolla University of
More informationProcess Modelling Notations
Process Modelling Notations Event-driven Process Chains (EPC) Business Process Modelling Notation (BPMN) Workflow Management Agenda Motivation for BPM EPC BPMN Case Study 1 Why Business Process Modelling
More informationNaming vs. Locating Entities
Naming vs. Locating Entities Till now: resources with fixed locations (hierarchical, caching,...) Problem: some entity may change its location frequently Simple solution: record aliases for the new address
More informationData Quality Mining: Employing Classifiers for Assuring consistent Datasets
Data Quality Mining: Employing Classifiers for Assuring consistent Datasets Fabian Grüning Carl von Ossietzky Universität Oldenburg, Germany, fabian.gruening@informatik.uni-oldenburg.de Abstract: Independent
More informationFiskP, DLLP and XML
XML-based Data Integration for Semantic Information Portals Patrick Lehti, Peter Fankhauser, Silvia von Stackelberg, Nitesh Shrestha Fraunhofer IPSI, Darmstadt, Germany lehti,fankhaus,sstackel@ipsi.fraunhofer.de
More informationBRIDGING THE GAP BETWEEN BUSINESS MODELS AND WORKFLOW SPECIFICATIONS
International Journal of Cooperative Information Systems c World Scientific Publishing Company BRIDGING THE GAP BETWEEN BUSINESS MODELS WORKFLOW SPECIFICATIONS JULIANE DEHNERT Fraunhofer ISST, Mollstr.
More informationPetri Net based Verification and
Petri Net based Verification and Reconfiguration of BPMN Represented Configured Construction Processes Faikcan Kog PhD candidate, Institute of Construction Informatics, Faculty of Civil Engineering, Technische
More informationExtending Role-based Access Control for Business Usage
Extending Role-based Access Control for Business Usage Heiko Klarl 1, 2, Korbinian Molitorisz 3, Christian Emig 1, 3, Karsten Klinger 1 and Sebastian Abeck 3 1 ic Consult GmbH, Keltenring 14, 82041 Oberhaching,
More informationestatistik.core: COLLECTING RAW DATA FROM ERP SYSTEMS
WP. 2 ENGLISH ONLY UNITED NATIONS STATISTICAL COMMISSION and ECONOMIC COMMISSION FOR EUROPE CONFERENCE OF EUROPEAN STATISTICIANS Work Session on Statistical Data Editing (Bonn, Germany, 25-27 September
More informationStructured Business Process Modeling (SBPM)
Structured Business Process Modeling (SBPM) Alfred Holl Department of Computer Science, University of Applied Sciences at Nuremberg, Germany Alfred.Holl@fh-nuernberg.de Gregor Valentin Department of Computer
More informationAN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC
AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.
More informationModeling Quality Information within Business Process Models
Modeling Quality Information within Business Process Models Robert Heinrich, Alexander Kappe, Barbara Paech University of Heidelberg, Institute of Computer Science, Im Neuenheimer Feld 326, 69120 Heidelberg,
More informationRandom vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison
Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison Tomi Janhunen 1, Ilkka Niemelä 1, Johannes Oetsch 2, Jörg Pührer 2, and Hans Tompits 2 1 Aalto University, Department
More informationA Decentralized Broker Architecture for Collaborative Business Process Modelling and Enactment
A Decentralized Broker Architecture for Collaborative Business Process Modelling and Enactment Bernhard Bauer 1, Jörg P. Müller 2, Stephan Roser 1,2 1 Programming of Distributed Systems, Institute of Computer
More informationTransformation of BPMN models for Behaviour Analysis
Transformation of BPMN models for Behaviour Analysis Ivo Raedts 1, Marija Petković 1, Yaroslav S. Usenko 1, Jan Martijn van der Werf 1, Jan Friso Groote 1, Lou Somers 1 1 LaQuSo, Laboratory for Quality
More informationAMFIBIA: A Meta-Model for the Integration of Business Process Modelling Aspects
AMFIBIA: A Meta-Model for the Integration of Business Process Modelling Aspects Björn Axenath, Ekkart Kindler, Vladimir Rubin Software Engineering Group, University of Paderborn, Warburger Str. 100, D-33098
More informationVisual Enhancements of Enterprise Models
Multikonferenz Wirtschaftsinformatik 2006 Visualisation Methods for KM Applications Visual Enhancements of Enterprise Models Hans-Georg Fill Peter Höfferer Agenda 1 Motivation - Positioning 2 Visual Enhancements
More informationProcess Mining by Measuring Process Block Similarity
Process Mining by Measuring Process Block Similarity Joonsoo Bae, James Caverlee 2, Ling Liu 2, Bill Rouse 2, Hua Yan 2 Dept of Industrial & Sys Eng, Chonbuk National Univ, South Korea jsbae@chonbukackr
More informationTowards Process Evaluation in Non-automated Process Execution Environments
Towards Process Evaluation in Non-automated Process Execution Environments Nico Herzberg, Matthias Kunze, Andreas Rogge-Solti Hasso Plattner Institute at the University of Potsdam Prof.-Dr.-Helmert-Strasse
More informationService Engineering, Business Process Management and Design
7 th INTERNATIONAL MULTIDISCIPLINARY CONFERENCE Baia Mare, Romania, May 17-18, 2007 ISSN-1224-3264 BUSINESS PROCESS MANAGEMENT SOFTWARE IN THE FIELD OF SERVICE ENGINEERING Helmut, Aschbacher DI (FH), university
More informationTowards Understanding Process Modeling The Case of the BPM Academic Initiative
Towards Understanding Process Modeling The Case of the BPM Academic Initiative Matthias Kunze, Alexander Luebbe, Matthias Weidlich, and Mathias Weske Hasso Plattner Institute at the University of Potsdam
More informationSemantics of UML class diagrams
1 Otto-von-Guericke Universität Magdeburg, Germany April 26, 2016 Sets Definition (Set) A set is a collection of objects. The basic relation is membership: x A (x is a member of A) The following operations
More informationUlmer Informatik-Berichte. Correct Configuration of Process Variants in Provop. Alena Hallerbach, Thomas Bauer, Manfred Reichert
Correct Configuration of Process Variants in Provop Alena Hallerbach, Thomas Bauer, Manfred Reichert Ulmer Informatik-Berichte Nr. 2009-03 Februar 2009 Ulmer Informatik Berichte Universität Ulm Fakultät
More informationTOWARDS AN AUTOMATED HEALING OF 3D URBAN MODELS
TOWARDS AN AUTOMATED HEALING OF 3D URBAN MODELS J. Bogdahn a, V. Coors b a University of Strathclyde, Dept. of Electronic and Electrical Engineering, 16 Richmond Street, Glasgow G1 1XQ UK - jurgen.bogdahn@strath.ac.uk
More informationGOAL-BASED INTELLIGENT AGENTS
International Journal of Information Technology, Vol. 9 No. 1 GOAL-BASED INTELLIGENT AGENTS Zhiqi Shen, Robert Gay and Xuehong Tao ICIS, School of EEE, Nanyang Technological University, Singapore 639798
More informationTest Coverage Criteria for Autonomous Mobile Systems based on Coloured Petri Nets
9th Symposium on Formal Methods for Automation and Safety in Railway and Automotive Systems Institut für Verkehrssicherheit und Automatisierungstechnik, TU Braunschweig, 2012 FORMS/FORMAT 2012 (http://www.forms-format.de)
More informationSborník vědeckých prací Vysoké školy báňské - Technické univerzity Ostrava číslo 2, rok 2005, ročník LI, řada strojní článek č.
Sborník vědeckých prací Vysoké školy báňské - Technické univerzity Ostrava číslo 2, rok 2005, ročník LI, řada strojní článek č. 1489 Dongbo WANG *, Xiu-Tian YAN **, J. Ion WILLIAM ***, Runxiao WANG ****,
More informationOn the Cognitive Effectiveness of Routing Symbols in Process Modeling Languages
On the Cognitive Effectiveness of Routing Symbols in Process Modeling Languages Kathrin Figl 1, Jan Mendling 2, Mark Strembeck 1, Jan Recker 3 1 Vienna University of Economics and Business, 1090 Vienna,
More informationÜber die Semantik von Modellierungssprachen
Über die Semantik von Modellierungssprachen und des UML-Standards Prof. Dr. Bernhard Rumpe Technische Universität Braunschweig http://www.sse.cs.tu-bs.de/ Seite 2 What is a model? And why do we need modeling
More informationEXPLORING GENERIC IDENTITY MANAGEMENT PROCESSES
EXPLORING GENERIC IDENTITY MANAGEMENT PROCESSES An approach to model the generic Identity and Access Management Process "approve-request" by Arslan Brömme ConSecur GmbH, Meppen, Germany Arslan.broemme@aviomatik.de
More informationEnriching Software Process Support by Knowledge-based Techniques *
Enriching Software Process Support by Knowledge-based Techniques * Barbara Dellen, Frank Maurer, Jürgen Münch, Martin Verlage + Fachbereich Informatik, Universität Kaiserslautern, Postfach 3049, 67653
More informationFormal Concept Analysis used for object-oriented software modelling Wolfgang Hesse FB Mathematik und Informatik, Univ. Marburg
FCA-SE 10 Formal Concept Analysis used for object-oriented software modelling Wolfgang Hesse FB Mathematik und Informatik, Univ. Marburg FCA-SE 20 Contents 1 The role of concepts in software development
More informationFunctional Modelling in secondary schools using spreadsheets
Functional Modelling in secondary schools using spreadsheets Peter Hubwieser Techn. Universität München Institut für Informatik Boltzmannstr. 3, 85748 Garching Peter.Hubwieser@in.tum.de http://ddi.in.tum.de
More informationOptimization of Sequences of XML Schema Modifications - The ROfEL Approach
Optimization of Sequences of XML Schema Modifications - The ROfEL Approach Thomas Nösinger, Meike Klettke, Andreas Heuer Database Research Group University of Rostock, Germany (tn, meike, ah)@informatik.uni-rostock.de
More informationARIS Education Package Process Design & Analysis
ARIS Education Package Process Design & Analysis ARIS Architect Beginner Modeling Exercises Version 2.1 3, August, 2015 8/3/2015 2015 Software AG. All rights reserved. Table of Contents Introduction...
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationEFFECTIVE CONSTRUCTIVE MODELS OF IMPLICIT SELECTION IN BUSINESS PROCESSES. Nataliya Golyan, Vera Golyan, Olga Kalynychenko
380 International Journal Information Theories and Applications, Vol. 18, Number 4, 2011 EFFECTIVE CONSTRUCTIVE MODELS OF IMPLICIT SELECTION IN BUSINESS PROCESSES Nataliya Golyan, Vera Golyan, Olga Kalynychenko
More informationSimple Solution for a Location Service. Naming vs. Locating Entities. Forwarding Pointers (2) Forwarding Pointers (1)
Naming vs. Locating Entities Till now: resources with fixed locations (hierarchical, caching,...) Problem: some entity may change its location frequently Simple solution: record aliases for the new address
More informationEnabling Flexibility of Business Processes by Compliance Rules
Enabling Flexibility of Business Processes by Compliance Rules A Case Study from the Insurance Industry Thanh Tran Thi Kim 1, Erhard Weiss 1, Christoph Ruhsam 1 Christoph Czepa 2, Huy Tran 2, Uwe Zdun
More informationAnalysis and Implementation of Workflowbased Supply Chain Management System
Analysis and Implementation of Workflowbased Supply Chain Management System Yan Tu 1 and Baowen Sun 2 1 Information School, Central University of Finance and Economics, Beijing, 100081, P.R.China,Yolanda_tu@yahoo.com.cn
More informationCassandra. References:
Cassandra References: Becker, Moritz; Sewell, Peter. Cassandra: Flexible Trust Management, Applied to Electronic Health Records. 2004. Li, Ninghui; Mitchell, John. Datalog with Constraints: A Foundation
More informationSeparating Compliance Management and Business Process Management
Separating Compliance Management and Business Process Management Elham Ramezani 1, Dirk Fahland 2, Jan Martijn van der Werf 2, and Peter Mattheis 1 1 Hochschule Furtwangen, Germany (ramezani Peter.Mattheis)@hs-furtwangen.de
More informationOn strong fairness in UNITY
On strong fairness in UNITY H.P.Gumm, D.Zhukov Fachbereich Mathematik und Informatik Philipps Universität Marburg {gumm,shukov}@mathematik.uni-marburg.de Abstract. In [6] Tsay and Bagrodia present a correct
More informationIMPROVING BUSINESS PROCESS MODELING USING RECOMMENDATION METHOD
Journal homepage: www.mjret.in ISSN:2348-6953 IMPROVING BUSINESS PROCESS MODELING USING RECOMMENDATION METHOD Deepak Ramchandara Lad 1, Soumitra S. Das 2 Computer Dept. 12 Dr. D. Y. Patil School of Engineering,(Affiliated
More informationModeling and Simulation of Workflow Processes Using Multi-level Petri Nets
Modeling and Simulation of Workflow Processes Using Multi-level Petri Nets Marina Flores-Badillo, Ernesto López-Mellado, Mayra Padilla-Duarte CINVESTAV Unidad Guadalajara Av. Científica 1148, Col. El Bajío,
More informationBIS 3106: Business Process Management. Lecture Two: Modelling the Control-flow Perspective
BIS 3106: Business Process Management Lecture Two: Modelling the Control-flow Perspective Makerere University School of Computing and Informatics Technology Department of Computer Science SEM I 2015/2016
More informationCSC 742 Database Management Systems
CSC 742 Database Management Systems Topic #4: Data Modeling Spring 2002 CSC 742: DBMS by Dr. Peng Ning 1 Phases of Database Design Requirement Collection/Analysis Functional Requirements Functional Analysis
More informationA first step towards modeling semistructured data in hybrid multimodal logic
A first step towards modeling semistructured data in hybrid multimodal logic Nicole Bidoit * Serenella Cerrito ** Virginie Thion * * LRI UMR CNRS 8623, Université Paris 11, Centre d Orsay. ** LaMI UMR
More informationValidation of Agile Workflows using Simulation
1 Validation of Agile Workflows using Simulation Kai Jander Lars Braubach Alexander Pokahr Winfried Lamersdorf Distributed Systems and Information Systems Computer Science Department, University of Hamburg
More informationARIS Design Platform Getting Started with BPM
Rob Davis and Eric Brabander ARIS Design Platform Getting Started with BPM 4y Springer Contents Acknowledgements Foreword xvii xix Chapter 1 An Introduction to BPM 1 1.1 Brief History of Business Process
More information2. Basic Relational Data Model
2. Basic Relational Data Model 2.1 Introduction Basic concepts of information models, their realisation in databases comprising data objects and object relationships, and their management by DBMS s that
More informationIntegration of Microsoft Visio and Eclipse Modeling Framework Using M3-Level-Based Bridges
Integration of Microsoft Visio and Eclipse Modeling Framework Using M3-Level-Based Bridges Heiko Kern and Stefan Kühne Business Information Systems, University of Leipzig Johannisgasse 26, 04103 Leipzig,
More informationAutomatic Transformation of Hospital Processes into an Executable Model with EPML
Automatic Transformation of Hospital Processes into an Executable Model with EPML Matthias Kühn Technical University Ilmenau Ehrenbergstraße 29 98693 Ilmenau, Germany Joachim Lippold Technical University
More informationReferent Tracking for Command and Control Messaging Systems
Referent Tracking for Command and Control Messaging Systems Shahid Manzoor, Werner Ceusters and Barry Smith Center of Excellence in Bioinformatics & Life Sciences, University at Buffalo 701 Ellicott Street,
More informationPLG: a Framework for the Generation of Business Process Models and their Execution Logs
PLG: a Framework for the Generation of Business Process Models and their Execution Logs Andrea Burattin and Alessandro Sperduti Department of Pure and Applied Mathematics University of Padua, Italy {burattin,sperduti}@math.unipd.it
More informationExploring Generic Identity Management Processes
Exploring Generic Identity Management Processes An approach to model the generic Identity and Access Management Process "approve" by Arslan Brömme Andreas Netzer Dr. Horst Walther ConSecur GmbH, Meppen,
More informationA Knowledge-based Product Derivation Process and some Ideas how to Integrate Product Development
A Knowledge-based Product Derivation Process and some Ideas how to Integrate Product Development (Position paper) Lothar Hotz and Andreas Günter HITeC c/o Fachbereich Informatik Universität Hamburg Hamburg,
More informationIE 680 Special Topics in Production Systems: Networks, Routing and Logistics*
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti
More information