In: Lecture Notes in Computer Science : Embedded and Ubiquitous Computing, Volume 4096, 2006, pages 732-741. 2006. URL: http://dx.doi.org/10.1007/1180216774.
Abstract: The effective scheduling of transactions has 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 Petri-net based approach to the scheduling of transactions generated by a test-case generator. Firstly, an extended scheduling timed Petri nets (ESTPN) model is given to support transaction scheduling. Secondly, the short term of "scheduling of transactions problem" is formulated by means of an ESTPN which can accommodate various scheduling policies. Finally, transactions scheduling schemes and scheduling algorithm based on ESTPN are given and cases are studied.
Back to the Petri Nets Bibliography