Building a PN Model: Task Ordering
We consider 6 tasks for which the conditions of execution
are defined by the following rules:
At the begining, the task 1 is executable
Tasks 2 and 3 can be executed after the end of task 1
Task 4 after the end of task 3.
Task 5 after the end of tasks 2 and 4
Task 6 after the end of tasks 4 and 5
Task 1 can be reexecuted after the end of task 2,
Task 3 can be reexecuted after the end of tasks 1 and 6
Building a Petri net Model: Task Ordering
Diapositiva precedente
Diapositiva successiva
Torna alla prima diaposiva
Visualizza versione grafica