Feasibility interval for the transactional event handlers of P-FRP

► We rigorously prove that task abortions in P-FRP are bounded within the Least Common Multiple (LCM) of task periods. ► We formally derive a value of the feasibility interval in P-FRP. ► We address both synchronous and asynchronous releases of P-FRP tasks. ► Feasibility intervals of synchronous releases in P-FRP are proved to be the same as those in the preemptive model. ► A game-board method is proposed to compute the actual response time.