By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jinshan Yu ; Nat. Univ. of Defense Technol., Changsha ; Tun Li ; Qingping Tan

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.

Published in:

Systems, 2007. ICONS '07. Second International Conference on

Date of Conference:

22-28 April 2007