{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:34:59Z","timestamp":1767008099190,"version":"3.32.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/memcod.2005.1487903","type":"proceedings-article","created":{"date-parts":[[2005,7,27]],"date-time":"2005-07-27T17:52:28Z","timestamp":1122486748000},"page":"131-140","source":"Crossref","is-referenced-by-count":5,"title":["Improving SystemC simulation through Petri net reductions"],"prefix":"10.1109","author":[{"given":"N.","family":"Savoiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Sandeep Shukla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Rajesh Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","article-title":"Quasi-static scheduling of embedded software using equal conflict nets","author":"sgroi","year":"1999","journal-title":"Proc Int Conf Application and Theory of Petri Nets"},{"key":"15","article-title":"Petri net-based thread composition for improved system level simulation","volume":"3","author":"savoiu","year":"0","journal-title":"Technical Report"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/71.553301"},{"key":"13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/18172.18191","article-title":"A Petri net reduction algorithm for protocol analysis","author":"ramamoorthy","year":"1986","journal-title":"Proc Acm Communications Architectures and Protocols Conf"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9"},{"journal-title":"Open SystemC Initiative","year":"0","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/5.21072"},{"key":"3","article-title":"Reduction and synthesis of live and bounded free choice petri nets","author":"esparza","year":"1991","journal-title":"Information and Computation"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526558"},{"key":"1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/978-3-540-47919-2_8","article-title":"Structure theory of petri nets: The free choice hiatus","volume":"254","author":"best","year":"1986","journal-title":"Lecture Notes in Computer Science"},{"year":"0","key":"10"},{"key":"7","article-title":"Software synthesis of process based concurrent programs","author":"lin","year":"1998","journal-title":"Proceedings of the 35th Design Automation Conference"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0046847"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008271916548"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1007\/BF02577777","article-title":"The hierarchical task graph as a universal intermediate representation","volume":"22","author":"girkar","year":"1994","journal-title":"International Journal of Parallel Programming"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"journal-title":"Memocode 2005 Appendix","year":"0","key":"8"}],"event":{"name":"Third ACM & amp; IEEE International Conference on Formal Methods and Models for Co-Design","acronym":"MEMCOD-05","location":"Verona, Italy"},"container-title":["Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9956\/32009\/01487903.pdf?arnumber=1487903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T19:00:01Z","timestamp":1735844401000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1487903\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/memcod.2005.1487903","relation":{},"subject":[]}}