Algorithm 2: Forming a PDT Based on Priorities FNA

Require (input): algorithm 1 // criticality C of every task in PA Ensure (output): PDT 1. The C of T is calculated for all PAs // Re-prioritization globally among all PA 2. The normal (N) of T is calculated for all PA 3. Empty Priority list (P) and stack (S) 4. Push the C into stack S in decreasing order 5. While the stack S is not empty do 6. If top (S) is not the highest critical C then 7. S $\leftarrow$ the highest critical C 8. Else 9. P $\leftarrow$ top (S) 10. pop top (S) 11. End if 12. End while