Scheduling of Transactions under Resource Constraint Based on Extended Preemptive Time Petri Nets for SoC System-Level Test-Case Generation

The transaction-based verification method and the effective scheduling of transactions have a great potential for SoC functional verification. Petri nets have proven to be a promising technique for solving scheduling problem. This paper aims at presenting a extended preemptive time Petri net (EPTPN) based approach to the scheduling of transactions under TAM resource constraint generated by a transaction test-case generator. Firstly, the short term of 'scheduling of transactions problem' is formulated by means of an EPTPN. Secondly, transactions scheduling algorithm based on EPTPN is given. Finally, cases are studied to show the method effective.