{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:38:29Z","timestamp":1729654709155,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cmpsac.2002.1045086","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T19:45:08Z","timestamp":1056570308000},"page":"717-722","source":"Crossref","is-referenced-by-count":1,"title":["Toward efficient algorithms for generating compact Petri nets from labeled transition systems"],"prefix":"10.1109","author":[{"given":"U.","family":"Buy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Singal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/3-540-56689-9_54","article-title":"Compositional state space generation","author":"valmari","year":"1993","journal-title":"Advances in Petri Nets 1993 LNCS 674"},{"key":"13","first-page":"293","article-title":"Reachability analysis of Petri nets using symmetries","volume":"8","author":"starke","year":"1991","journal-title":"Syst Anal Model Simul"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0023729"},{"article-title":"Cabernet: A customizable environment for the specification and analysis of real-time systems","year":"1994","author":"pezze?","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/71.553301"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/12.707587"},{"key":"2","first-page":"19","article-title":"Checking properties of nets using transformations","author":"berthelot","year":"1987","journal-title":"Advances in Petri Nets 1985"},{"key":"1","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-59293-8_207","article-title":"Polynomial algorithms for the synthesis of bounded nets","volume":"915","author":"badouel","year":"1995","journal-title":"Lecture Notes in Computer Science"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/32.286423"},{"journal-title":"Communication and Concurrency","year":"1989","author":"milner","key":"7"},{"key":"6","first-page":"131","article-title":"A slicing-based approach to enhance Petri net reachability analysis","volume":"32","author":"lee","year":"2000","journal-title":"Journal of Research and Practice in Information Technology"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/201024.201038"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050046"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90180-N"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/32.21759"}],"event":{"name":"26th Annual International Computer Software and Applications","acronym":"CMPSAC-02","location":"Oxford, UK"},"container-title":["Proceedings 26th Annual International Computer Software and Applications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8094\/22390\/01045086.pdf?arnumber=1045086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:43:24Z","timestamp":1497552204000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1045086\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/cmpsac.2002.1045086","relation":{},"subject":[]}}