Informationssystem och databasteknik, 2I-1100

1. Informationssystem och databasteknik, 2I-1100 Processer System Modeller

2. Definition of Business Process A set of activities that takes one or more types of inputs and turns them into an output of greater value to the customer. [Hammer] input output input

3. Definition of Business Process A specific ordering of work activities across time and place, with a beginning, an end, and clearly-defined inputs and outputs; a structure for action. [Davenport] input output input

4. An Informal Workflow Order register * for each order line Credit check Stop order Check order line not OK i lager OK Add to order Ship Credit manager Order manager

5. Task Parallelism Selection Resource An Informal Workflow Order register * for each order line Credit check Stop order Check order line not OK i lager OK Add to order Ship Credit manager Order manager

6. Basic Workflow Concepts • Task - a logical unit of work that is carried out as a single whole • Resource - a person or a machine that can perform specific tasks • Activity - the performance of a task by a a resource • Case - a sequence of activities performed to achieve some goal, an order, an insurance claim, a car assembly • Work item - the combination of a case and a task that is just to be carried out • Process - describes how a particular category of cases shall be managed • Control flow construct - sequence, selection, iteration, parallelisation

7. Basic Workflow Concepts Activity Case Resource Work Item Task Process Allocation Resource Type

8. Application Process send accept prepare accept letter tokens transition place accept ready1 ready2 check validity under consideration applications reject send reject prepare reject letter When a transition fires it removes one token from each input place and adds one token to each output place

9. Application Process send accept prepare accept letter accept ready1 ready2 check validity under consideration applications reject send reject prepare reject letter When a transition fires it removes one token from each input place and adds one token to each output place

10. Application Process send accept prepare accept letter accept ready1 ready2 check validity under consideration applications reject send reject prepare reject letter When a transition fires it removes one token from each input place and adds one token to each output place

11. Application Process send accept prepare accept letter accept ready1 ready2 check validity under consideration applications reject send reject prepare reject letter When a transition fires it removes one token from each input place and adds one token to each output place

12. Application Process send accept prepare accept letter tokens transition place accept ready1 ready2 check validity under consideration applications reject send reject prepare reject letter When a transition fires it removes one token from each input place and adds one token to each output place

13. Application Process send accept prepare accept letter accept ready1 ready2 check validity under consideration applications reject send reject prepare reject letter When a transition fires it removes one token from each input place and adds one token to each output place

14. Application Process send accept prepare accept letter accept ready1 ready2 check validity under consideration applications reject send reject prepare reject letter When a transition fires it removes one token from each input place and adds one token to each output place

15. Application Process send accept prepare accept letter accept ready1 ready2 check validity under consideration applications reject send reject prepare reject letter When a transition fires it removes one token from each input place and adds one token to each output place

16. Enabled Transition A transition is enabled when there is a token in each of its input places Not enabled Enabled

17. Dutch Traffic Light red yr rg yellow green gy

18. Dutch Traffic Light red yr rg yellow green gy

19. Dutch Traffic Light red yr rg yellow green gy

20. Dutch Traffic Light red yr rg yellow green gy

21. Two Traffic Lights red1 yr1 red2 yr2 yellow1 yellow2 rg1 rg2 green2 green1 gy1 gy2

22. Two Traffic Lights red1 yr1 red2 yr2 yellow1 yellow2 rg1 rg2 green2 green1 gy1 gy2

23. Two Traffic Lights red1 yr1 red2 yr2 yellow1 yellow2 rg1 rg2 green2 green1 gy1 gy2

24. Two Traffic Lights red1 yr1 red2 yr2 yellow1 yellow2 rg1 rg2 green2 green1 gy1 gy2

25. Two Traffic Lights red1 yr1 red2 yr2 yellow1 yellow2 rg1 rg2 green2 green1 gy1 gy2

26. Two Traffic Lights red1 yr1 red2 yr2 yellow1 yellow2 rg1 rg2 green2 green1 gy1 gy2

27. Two Traffic Lights red1 yr1 red2 yr2 yellow1 yellow2 rg1 rg2 green2 green1 gy1 gy2

28. Exercise - Traffic Light Construct a Petri net for a traffic light that has four possible states: - red - yellow - green - red + yellow The light moves from red to (red + yellow) and then to green. From green it moves to yellow and then to red.

29. Coloured Petri Nets send accept In a classical Petri net, tokens have no structure. In a coloured Petri net, each token is associated with a data structure. prepare accept letter accept claims ready1 amount < 1000 ready2 amount > 1000 check validity under consideration reject send reject prepare reject letter [name: John Doe, amount: 5000] [name: Mary Doe, amount: 400]

30. Coloured Petri Nets send accept prepare accept letter accept claims ready1 amount < 1000 ready2 amount > 1000 check validity under consideration reject send reject prepare reject letter [name: John Doe, amount: 5000] [name: Mary Doe, amount: 400]

31. Coloured Petri Nets send accept In a coloured Petri net, the values of a token’s data structure can be used in preconditions that determine which transition that will fire. prepare accept letter accept claims ready1 amount < 1000 ready2 amount > 1000 check validity under consideration reject send reject prepare reject letter [name: John Doe, amount: 5000] [name: Mary Doe, amount: 400]

32. Coloured Petri Nets send accept prepare accept letter accept claims ready1 amount < 1000 ready2 amount > 1000 check validity under consideration reject send reject prepare reject letter [name: John Doe, amount: 5000] [name: Mary Doe, amount: 400]

33. Coloured Petri Nets send accept prepare accept letter accept claims ready1 amount < 1000 ready2 amount > 1000 check validity under consideration reject send reject prepare reject letter [name: John Doe, amount: 5000] [name: Mary Doe, amount: 400]

34. Coloured Petri Nets send accept prepare accept letter accept claims ready1 amount < 1000 ready2 amount > 1000 check validity under consideration reject send reject prepare reject letter [name: John Doe, amount: 5000] [name: Mary Doe, amount: 400]

35. Coloured Petri Nets send accept prepare accept letter accept claims ready1 amount < 1000 ready2 amount > 1000 check validity under consideration reject send reject prepare reject letter [name: John Doe, amount: 5000] [name: Mary Doe, amount: 400]

36. Petri Net with Time 15 20 Every token gets a timestamp, indicating the time from which the token is available. A transition is enabled when each token to be consumed has a timestamp equal or prior to the current time. Each transition gives a delay to a token produced by the transition. 10

37. Petri Net with Time 15 20 10 10 30 Before current time = 20, the transition is not enabled and cannot fire. At current time = 20, it will fire. The timestamp of the produced token equals the current time + the transition delay.

38. Two Traffic Lights with Time 0 0 30 30 red1 yr1 red2 yr2 0 0 yellow1 yellow2 rg1 rg2 25 25 0 5 5 green2 green1 gy1 gy2 Current time = 0

39. Two Traffic Lights with Time 0 30 30 red1 yr1 red2 yr2 0 0 yellow1 yellow2 rg1 rg2 25 25 5 5 green2 green1 gy1 gy2 25 Current time = 1

40. Two Traffic Lights with Time 0 30 30 red1 yr1 red2 yr2 0 0 yellow1 yellow2 rg1 rg2 25 25 30 5 5 green2 green1 gy1 gy2 Current time = 26

41. Two Traffic Lights with Time 0 30 30 red1 yr1 red2 yr2 60 0 0 yellow1 yellow2 rg1 rg2 25 25 30 5 5 green2 green1 gy1 gy2 Current time = 31

42. Two Traffic Lights with Time 30 30 red1 yr1 red2 yr2 60 0 0 yellow1 yellow2 rg1 rg2 25 25 5 5 green2 green1 gy1 gy2 56 Current time = 32

43. Swimming School Exercise A student registers at the swimming school. The student will take one or more swimming lessons followed by an examination. Every lesson has a beginning and an end. A student must have his or her individual teacher during a lesson. There are five teachers. Each swimming lesson is followed by another swimming lesson or an individual examination. An examiner is present at the examination, from beginning to end. There are two examiners. When a student has completed an examination, three things might happen: 1. The student passes and leaves the school 2. The student fails, takes additional lessons, and tries again 3. The student fails and gives up a) Model this using a classical Petri net b) Use a coloured Petri net to express that it is required to take 10 lessons before taking the exam and that students drop out after three failed exams c) Add time to model that a lesson takes one hour and an exam 30 min.

44. Basic Workflow Concepts • Task - a logical unit of work that is carried out as a single whole • Resource - a person or a machine that can perform specific tasks • Activity - the performance of a task by a a resource • Case - a sequence of activities performed to achieve some goal, an order, an insurance claim, a car assembly • Work item - the combination of a case and a task that is just to be carried out • Process - describes how a particular category of cases shall be managed • Control flow construct - sequence, selection, iteration, parallelisation

45. Workflow Concepts in Petri Nets • Task - transition • Resource - token • Activity - transition that fires • Case - token • Work item - enabled transition • Process - Petri net • Control flow construct - modelled by places and transitions

46. Triggers Kinds of triggers When do transitions fire? Sometimes, someone or something has to fire them. A work item can only be transformed into an activity once it has been triggered. A resource initiative An external event A time signal

47. Triggers customer answer manage receive order ask for customer info cancel no answer

48. Application Application Application Application DBMS UIMS WFMS DBMS UIMS DBMS Operating System Operating System Operating System Operating System 1965 - 1975 1975 - 1985 1985 - 1995 1995 - 2005 A Historical Perspective

49. BeslutstypVilka typer av beslut som systemet stödjer Strategiska Taktiska Operationella FunktionerVilken funktion i organisationen som systemet stöder Marknadsföring Tillverkning och tjänster Ekonomi Personal Klassifikation av informationssystem

50. Typer av beslutsstödssystem Transaction Processing Systems (TPS) Alla dessa system stödjer besluts- fattande INFORMATIONS- BEHOV Management Information Systems (MIS) Intelligent SupportSystems (ISS)