Process management monitoring

• US 20050137928A1
• Filed: 12/19/2003
• Published: 06/23/2005
• Est. Priority Date: 12/19/2003
• Status: Abandoned Application

• Current Assignee: SAP SE
• Original Assignee: SAP SE
• Inventors: Toebben, Stephan, Scholl, Juergen
• Application Number:
  US10/741,241
• Publication Number:
  US 20050137928A1
• Time in Patent Office: Days
• US Class Current: 705/9
• CPC Class Codes: G06Q 10/0631 Resource planning, allocation, distributing or scheduling for enterprises or organisations
• CPC Class Codes: G06Q 10/087 Inventory or stock management, e.g. order filling, procurement or balancing against orders
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

The inventions relate to computer-implemented methods, computer programs, computer program products, computers, and data structures for providing process monitoring functionality. A process object comprising at least one task object is defined. For said task object, at least one activity status is defined and rules within said process object are provided. The rules define a process object status based on said at least one activities status. The rules are executed on said at least one activity status of said at least one task object to determine said process object status.

Claims

1. A computer-implemented method for providing process monitoring functionality, with the steps of:

defining a process object comprising at least one task object;

defining for said task object at least one activity status;

providing rules within said process object, said rules defining a process object status based on said at least one activity status; and

executing said rules on said at least one activity status of said at least one task object to determine said process object status.

2. The computer-implemented method of claim 1, wherein multiple task objects are linked to one process object.

3. The computer-implemented method of claim 1, wherein for said task object at least one sub-task object is provided.

4. The computer-implemented method of claim 3, wherein each sub-task object provides a status, and wherein said sub-task status determines said activity status.

5. The computer-implemented method of claim 4, wherein said rules determine a dependence of activity statuses and/or statuses of sub-tasks to reach a certain process object status.

6. The computer-implemented method of claim 1, wherein each task object may be comprised of different statuses, and wherein a status relevant for said process object status is extracted.

7. The computer-implemented method of claim 1, wherein said process object together with its status is selectably visualised.

8. The computer-implemented method of claim 4, wherein said task and/or said sub-task is selectably visualised and wherein upon selection of said task and/or said sub-task their respective status is editable.

9. The computer-implemented method of claim 4, wherein said process object status and/or said activity status and/or said sub-task status is visualised.

10. The computer-implemented method of claim 1, wherein a summarised task status is determined, and wherein said summarised task status is visualised.

11. The computer-implemented method of claim 1, wherein a detailed task status is determined, and wherein said detailed task status is visualised.

12. The computer-implemented method of claim 1, wherein said statuses are visualised using icons.

13. The computer-implemented method of claim 1, wherein said rules define a process flow, and wherein said status is calculated based on said rules.

14. The computer-implemented method of claim 4, wherein said rules define pre-requisites sub-task statuses and/or activity statuses that have to match to reach a certain process object status and/or activity status, respectively.

15. The computer-implemented method of claim 3, wherein said rules are defined to lock a task in case at least one sub-task has a pre-defined status.

16. The computer-implemented method of claim 3, wherein said rules are defined to make a task executable in case sub-tasks have pre-defined statuses.

17. The computer-implemented method of claim 1, wherein said rules are defined to make a task non-available in case said task is neither locked nor executable.

18. The computer-implemented method of claim 4, wherein said activity status and/or sub-task status may be indicated as error, warning, requirement, locked, OK, incomplete, or info.

19. A computer-implemented method for providing process monitoring functionality, with the steps of:

defining a process object comprising at least one task object;

defining for said task object at least one activity status;

providing rules within said process object, said rules defining a process object status based on said at least one activity status;

executing said rules on said at least one activity status of said at least one task object to determine said process object status; and

selectably visualising said task and/or a sub-task, wherein upon selection of said task and/or said sub-task their respective status is editable.

20. A computer-implemented method for providing process monitoring functionality, with the steps of:

defining a process object comprising at least one task object;

defining for said task object at least one activity status;

providing rules within said process object, said rules defining a process object status based on said at least one activity status; and

executing said rules on said at least one activity status of said at least one task object to determine said process object status, wherein said rules define pre-requisites sub-task statuses and/or activity statuses have to match to reach certain process object status and/or activity status, respectively.

21. A computer program for providing process monitoring functionality, operable to cause a processor to:

store a process object definition comprising at least one task object, at least one activity status defined for said task object, and rules provided within said process object, said rules defining a process object status based on said at least one activity status; and

execute said rules on said at least one activity status of said at least one task object to determine said process object status.

22. The computer program of claim 21, operable to cause a processor to link multiple task objects to one process object.

23. The computer program of claim 21, operable to cause a processor to provide said task object at least one sub-task object.

24. The computer program of claim 23, operable to cause a processor to provide a status for each sub-task, and to determine said activity status from said sub-task status.

25. The computer program of claim 23, operable to cause a processor to determine a dependence of activity statuses and/or statuses of sub-tasks from said rules to reach a certain process object status.

26. The computer program of claim 21, operable to cause a processor to comprise different statuses within each task object, and extract a status relevant for said process object status.

27. The computer program of claim 21, operable to cause a processor to selectably visualise said process object together with its status.

28. The computer program of claim 24, operable to cause a processor to selectably visualise said task and/or said sub-task and edit upon selection of said task and/or said sub-task their respective status.

29. The computer program of claim 24, operable to cause a processor to visualise said process object status and/or said activity status and/or said sub-task status.

30. The computer program of claim 21, operable to cause a processor to determine a summarised task status and to visualise said summarised task status.

31. The computer program of claim 21, operable to cause a processor to determine a detailed task status and to visualise said detailed task status.

32. The computer program of claim 21, operable to cause a processor to visualise said statuses using icons.

33. The computer program of claim 21, operable to cause a processor to define a process flow with said rules, and to calculate said status based on said rules.

34. The computer program of claim 21, operable to cause a processor to define with said rules pre-requisites sub-task statuses and/or activity statuses that have to match to reach a certain process object status and/or activity status, respectively.

35. The computer program of claim 23, operable to cause a processor to lock a task in case at least one sub-task has a pre-defined status.

36. The computer program of claim 23, operable to cause a processor to make a task executable in case sub-tasks have pre-defined statuses.

37. The computer program of claim 21, operable to cause a processor to make a task non-available in case said task is neither locked nor executable.

38. The computer program of claim 24, operable to cause a processor to indicate said activity status and/or sub-task status as error, warning, requirement, locked, OK, incomplete, or info.

39. A computer program product for providing process monitoring functionality, with a computer program stored thereon operable to cause a processor to:

store a process object definition comprising at least one task object, at least one activity status defined for said task object, and rules provided within said process object, said rules defining a process object status based on said at least one activity status; and

execute said rules on said at least one activity status of said at least one task object to determine said process object status.

40. The computer program product of claim 39, said computer program operable to cause a processor to link multiple task objects to one process object.

41. The computer program product of claim 39, said computer program operable to cause a processor to provide said task object at least one sub-task object.

42. The computer program product of claim 41, said computer program operable to cause a processor to provide a status for each sub-task, and to determine said activity status from said sub-task status.

43. The computer program product of claim 42, said computer program operable to cause a processor to determine a dependence of activity statuses and/or statuses of sub-tasks from said rules to reach a certain process object status.

44. The computer program product of claim 39, said computer program operable to cause a processor to provide different statuses within each task object, and extract a status relevant for said process object status.

45. The computer program product of claim 39, said computer program operable to cause a processor to selectably visualise said process object together with its status.

46. The computer program product of claim 42, said computer program operable to cause a processor to selectably visualise said task and/or said sub-task and edit upon selection of said task and/or said sub-task their respective status.

47. The computer program product of claim 42, said computer program operable to cause a processor to visualise said process object status and/or said activity status and/or said sub-task status.

48. The computer program product of claim 39, said computer program operable to cause a processor to determine a summarised task status and to visualise said summarised task status.

49. The computer program product of claim 39, said computer program operable to cause a processor to determine a detailed task status and to visualise said detailed task status.

50. The computer program product of claim 39, said computer program operable to cause a processor to visualise said statuses using icons.

51. The computer program product of claim 39, said computer program operable to cause a processor to define a process flow with said rules, and to calculate said status based on said rules.

52. The computer program product of claim 39, said computer program operable to cause a processor to define with said rules pre-requisites sub-task statuses and/or activity statuses that have to match to reach a certain process object status and/or activity status, respectively.

53. The computer program product of claim 41, said computer program operable to cause a processor to lock a task in case at least one sub-task has a pre-defined status.

54. The computer program product of claim 41, said computer program operable to cause a processor to make a task executable in case sub-tasks have pre-defined statuses.

55. The computer program product of claim 39, said computer program operable to cause a processor to make a task non-available in case said task is neither locked nor executable.

56. The computer program product of claim 42, said computer program operable to cause a processor to indicate said activity status and/or sub-task status as error, warning, requirement, locked, OK, incomplete, or info.

57. A computer for providing process monitoring functionality, comprising:

storage means to store a process object definition comprising at least one task object, at least one activity status defined for said task object, and rules provided within said process object, said rules defining a process object status based on said at least one activity status; and

computing means to execute said rules on said at least one activity status of said at least one task object to determine said process object status.

58. The computer of claim 57, wherein said computing means link multiple task objects to one process object.

59. The computer of claim 57, wherein said storage means store for said task object at least one sub-task object.

60. The computer of claim 59, wherein said storage means store for each sub-task provides a status, and said computing means determine said activity status from said sub-task status.

61. The computer of claim 60, wherein said computing means compute said rules to determine a dependence of activity statuses and/or statuses of sub-tasks to reach a certain process object status.

62. The computer of claim 57, wherein said storage means store for each task object different statuses, and wherein said computing means extract a status relevant for said process object status.

63. The computer of claim 57, wherein display means selectably visualise process object together with its status.

64. The computer of claim 60, wherein display means selectably visualise said task and/or said sub-task and wherein upon selection of said task and/or said sub-task their respective status is editable.

65. The computer of claim 60, wherein display means visualise said process object status and/or said activity status and/or said sub-task status.

66. The computer of claim 57, wherein said computing means determine a summarised task status, and display means visualise said summarised task status.

67. The computer of claim 57, wherein said computing means determine a detailed task status, and wherein display means visualise said detailed task status.

68. The computer of claim 57, wherein display means visualise said statuses using icons.

69. The computer of claim 57, wherein said computing means utilize said rules to define a process flow, and wherein said computing means calculate said status based on said rules.

70. The computer of claim 57, wherein said computing means utilize said rules to define pre-requisites sub-task statuses and/or activity statuses that have to match to reach a certain process object status and/or activity status, respectively.

71. The computer of claim 59, wherein said computing means utilize said rules to lock a task in case at least one sub-task has a pre-defined status.

72. The computer of claim 59, wherein said computing means utilize said rules to make a task executable in case sub-tasks have pre-defined statuses.

73. The computer of claim 57, wherein said computing means utilize said rules to make a task non-available in case said task is neither locked nor executable.

74. The computer of claim 60, wherein said computing means utilize said rules to indicate said activity status and/or sub-task status as error, warning, requirement, locked, OK, incomplete, or info.

75. A data structure for providing process monitoring functionality, with definitions for:

a process object comprising at least one task object;

at least one activity status for said task object;

rules within said process object, said rules defining a process object status based on said at least one activity status, whereby said definitions provide executing said rules on said at least one activity status of said at least one task object to determine said process object status.

76. The data structure of claim 75, wherein multiple task objects are linked to one process object.

77. The data structure of claim 75, wherein for said task object at least one sub-task object is defined.

78. The data structure of claim 77, wherein for each sub-task a status is defined to determine said activity status from said sub-task status.

79. The data structure of claim 77, wherein said rules are defined to determine a dependence of activity statuses and/or statuses of sub-tasks to reach a certain process object status.

80. The data structure of claim 75, wherein rules to define a process flow are defined to calculate said status based on said rules.

81. The data structure of claim 75, wherein rules to define pre-requisites sub-task statuses and/or activity statuses that have to match to reach a certain process object status and/or activity status, respectively, are defined.