Video
Create Note
Dear user,
with the manuscript function you'll be able to create your own digital lecture manuscript.
However, in order to link all your notes with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
with the manuscript function you'll be able to create your own digital lecture manuscript.
However, in order to link all your notes with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Add a New Marker
Dear user,
with the marker function you'll be able to create your own digital time markers.
However, in order to link all your markers with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
with the marker function you'll be able to create your own digital time markers.
However, in order to link all your markers with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Tag this content
Please enable javascript to use this function.
Dear user,with the tagging function you'll be able to add taggs to videos.
However, in order to link all your tags with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Tags added to this content
No tags have been added to this content so far.
Add Link to this content
Please enable javascript to use this function.
Dear user,with the links function you'll be able to add links to other resources to this content.
However, in order to link all your links with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Links added to this content
No links have been added to this content so far.
Add to my playlist
Dear user,
with the playlist function you'll be able to create your own lecture video playlists.
However, in order to link all your playlists with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
with the playlist function you'll be able to create your own lecture video playlists.
However, in order to link all your playlists with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Playlists
This content is not used in any playlist.
1355218327939452154555561962366370772975987692392593293393994010511163147815681573169116921693174517461820190821902290239323942400240825122596283730633095322034913556370438644257426542724279428542864671467246734705
Lecture Structure
- Prozessorientierte Informationssysteme 2 (00:00:01)
- Organisation (00:00:35)
- Gliederung (00:00:52)
- Güm ßmw immw De nition (00:03:03)
- BPM Lebenszyklus (00:04:39)
- BPMN und Prozessmodell (00:06:34)
- Petri Netze Formale Beschreibung durch Petri Netze (00:08:41)
- Charakterisierung (00:08:41)
- Petri Netz ist ein gerichte er Graph bestehend aus Stellen (00:08:41)
- Transitionen und gerichteten Kanten zwischen diesen (00:08:41)
- Petri Netze sind bipartite Graphen d h Kanten zwischen zwei (00:08:41)
- Stellen und Kanten zwischen zwei Transitionen sind nicht erlaubt (00:08:41)
- I2check ame P2 orocessorder (00:08:41)
- BPMN und Prozessmodell (00:09:05)
- Petri Netze Formale Beschreibung durch Petri Netze (00:09:15)
- Definition Petri Netz (00:10:19)
- Petri Netze Formale Beschreibung durch Petri Netze (00:11:02)
- Definition Petri Netz (00:11:03)
- Definition 4 1 A Prßtrr nv i i n pln (P 1 (00:11:03)
- rv T110 r uf t n iti 1 ri T 1ill ( 7 iup r pl (00:11:03)
- Petri Netze Formale Beschreibung durch Petri Netze (00:11:47)
- Beispiel (00:12:09)
- Markierungen Das dynamische Verhalten eines Systems wird durch (00:12:39)
- Transition tist aktiviert falls auf allen Stellen im Vorbereich (set of (00:12:39)
- input places) von t ein Token liegt (00:12:39)
- Wenn t feuen wird von jeder Stelle im Vorbereich ein Token (00:12:39)
- entferm und aufjede Stelle im Nachbereich (set ofoutput places) (00:12:39)
- ein Token gelegt (00:12:39)
- Workflow Netze Definition (00:14:36)
- Workflow Netze Definition (00:15:25)
- Gliederung Motivation (00:15:40)
- Mining Algorithmen und ihre Eigenschaften (00:15:40)
- EV8 UatiO 1 VOFI 6 Sl6 6l 1 PFOZ6 Sm0d6 eFI (00:15:40)
- Motivation (00:17:31)
- Logeinträge Beispiel für Logeinträge (00:19:23)
- Funktion StoreCustomerData( MüIIer c1987 Bad Bentheim ) (00:19:23)
- Rechnung versenden für Rechnungsnummer 4567 beendet am (00:19:23)
- Funktion ContactCustomer(c1987 PromoMaiIing) ausgeführt am (00:19:23)
- Funktion ContactCustomer(c1988 PromoMaiIing) ausgeführt am (00:19:23)
- Logs bergen Informationen (00:24:38)
- Motivation (00:26:08)
- Logs bergen Informationen (00:26:13)
- Logeinträge Beispiel für Logeinträge (00:28:11)
- Funktion Cantac Customer(c1987 PromoMailing) ausgefühn am (00:28:11)
- Funktion SroreCus omerData( Miller c1988 Osnabr Jck ) (00:28:11)
- Funktion ContacrCus omer(c1988 PromoMailing) ausgeführt am (00:28:11)
- Motivation (00:28:12)
- In diesem Kapitel (00:28:12)
- 4E l H vF m1L www ÜH 3 1 N Ü Q H rw YÜ ZÜ f4YT f WH ÜN if rw M =wu r wa Wnx rw (00:28:12)
- Logeinträge Beispiel für Logeinträge (00:29:04)
- Logs bergen Informationen (00:29:05)
- Motivation (00:29:06)
- Gesamtbild Process Mining bus ness urooesses (software) (00:31:48)
- Ausführungslogs Annahmen (00:36:30)
- Hinweis (00:36:30)
- Abstraktion (00:36:30)
- Verfahren basieren häufig auf Abstraklion von Logs (00:36:30)
- Ausführungslogs Logformat (00:38:10)
- Ausführungslog lMh 11VWT l? 1HWI E es H s 1= 1 L wi x r M (00:39:53)
- Ausführungslog (00:39:54)
- case 2 task C (00:39:54)
- task A (00:39:54)
- task D (00:39:54)
- task E (00:39:54)
- task D (00:39:54)
- case 3 task C (00:39:54)
- task D (00:39:54)
- case 4 task B (00:39:54)
- case 4 task D (00:39:54)
- Ausführungslogs Logformat (00:40:00)
- Ausführungslog task A (00:40:08)
- case 1 task C (00:40:08)
- case 2 (00:40:08)
- task C (00:40:08)
- case 4 task A (00:40:08)
- task D (00:40:08)
- task D (00:40:08)
- case 3 task C (00:40:08)
- task D (00:40:08)
- case 4 task B (00:40:08)
- Process Discovery Algorithmen (00:41:52)
- Algorithmus (00:41:52)
- Schließlich Ausblick auf weitere Verfahren die mit (00:41:52)
- Noise umgehen können (00:41:52)
- Definitionen (00:43:16)
- Ausführungslog case 1 case 2 task A (00:47:17)
- case 1 task C (00:47:17)
- case 2 task B (00:47:17)
- case 2 task D (00:47:17)
- task E (00:47:17)
- case 3 task C (00:47:17)
- case 1 (00:51:03)
- Ordnungsrelationen (00:51:35)
- Ausführungslog Analyse case 1 case 2 task A (00:53:40)
- case 1 task C (00:53:40)
- case 2 task B (00:53:40)
- case 2 task D (00:53:40)
- task D (00:53:40)
- case 3 task C (00:53:40)
- o Algorithmus (00:59:16)
- erzeugen so das alle generierten Ausführungsfolgen die (00:59:16)
- Aus jeder Ordnungsrelation wird ein Petri Netz Fragment (00:59:16)
- u Algorithmus (01:01:44)
- a Algorithmus (01:10:41)
- cx Algorithmus (01:10:57)
- l Sf(0) (01:10:57)
- b w D23 (01:10:57)
- XAQA AB (01:10:57)
- (Pw Tw FW) (01:10:57)
- To= i (01:10:57)
- rst(c ) (01:10:57)
- u Algorithmus (01:11:05)
- (PWJ W (01:11:12)
- a(W) (01:11:12)
- WÄ (01:11:12)
- Pvv= (01:11:12)
- B (AB) (01:11:12)
- Xvv= (01:11:12)
- Iast(o) (01:11:12)
- Sl( G) (01:11:12)
- a Algorithmus (01:11:24)
- Ausführungslog Analyse case 1 case 2 task A (01:17:50)
- Ausführungslog case 1 case 2 task A (01:17:51)
- WWurmWMVm W um W ummwwu Mm m u (01:17:52)
- o Algorithmus (01:17:53)
- a Algorithmus (01:18:25)
Keyword
Please enable javascript to use this function.
Please enable javascript to use this function.