{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:36Z","timestamp":1725566136232},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159275"},{"type":"electronic","value":"9783642159282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15928-2_6","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T14:32:34Z","timestamp":1284993154000},"page":"75-90","source":"Crossref","is-referenced-by-count":2,"title":["A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes"],"prefix":"10.1007","author":[{"given":"Victor","family":"Khomenko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Chu, T.A.: Synthesis of Self-Timed VLSI Circuits from Graph-Theoretic Specifications. Ph.D. thesis, Lab. for Comp. Sci. MIT (1987)"},{"key":"6_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-8399-1","volume-title":"Universal Algebra","author":"P. Cohn","year":"1981","unstructured":"Cohn, P.: Universal Algebra, 2nd edn. Reidel, Dordrecht (1981)","edition":"2"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J. Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Branching processes of Petri nets. Acta Inf.\u00a028, 575\u2013591 (1991)","journal-title":"Acta Inf."},{"issue":"3","key":"6_CR4","first-page":"285","volume":"20","author":"J. Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. FMSD\u00a020(3), 285\u2013310 (2002)","journal-title":"FMSD"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. Ph.D. thesis, School of Comp. Sci., Newcastle Univ. (2003)","DOI":"10.1007\/3-540-45657-0_49"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-540-73094-1_14","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"V. Khomenko","year":"2007","unstructured":"Khomenko, V.: Behaviour-preserving transition insertions in unfolding prefixes. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol.\u00a04546, pp. 204\u2013222. Springer, Heidelberg (2007)"},{"key":"#cr-split#-6_CR7.1","doi-asserted-by":"crossref","unstructured":"Khomenko, V.: Efficient automatic resolution of encoding conflicts using STG unfoldings. IEEE Trans. VLSI Syst.??17(7), 855???868 (2009);","DOI":"10.1109\/TVLSI.2008.2012156"},{"key":"#cr-split#-6_CR7.2","unstructured":"Special section on asynchronous circuits and systems"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Khomenko, V.: A new type of behaviour-preserving transition insertions in unfolding prefixes. Tech. Rep. CS-TR-1189, School of Comp. Sci., Newcastle Univ. (2010), http:\/\/www.cs.ncl.ac.uk\/publications\/trs\/papers\/1189.pdf","DOI":"10.1007\/978-3-642-15928-2_6"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00236-003-0122-y","volume":"40","author":"V. Khomenko","year":"2003","unstructured":"Khomenko, V., Koutny, M., Vogler, V.: Canonical prefixes of Petri net unfoldings. Acta Inf.\u00a040(2), 95\u2013118 (2003)","journal-title":"Acta Inf."},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"Murata, T.: Petri nets: Properties, analysis and applications. Proc. of the IEEE\u00a077(4), 541\u2013580 (1989)","journal-title":"Proc. of the IEEE"},{"key":"6_CR11","first-page":"199","volume-title":"Proc. Workshop on Timed Petri Nets","author":"L. Rosenblum","year":"1985","unstructured":"Rosenblum, L., Yakovlev, A.: Signal graphs: from self-timed to timed ones. In: Proc. Workshop on Timed Petri Nets, pp. 199\u2013206. IEEE Comp. Soc. Press, Los Alamitos (1985)"},{"key":"6_CR12","first-page":"184","volume-title":"Proc. ICCAD 1990","author":"P. Vanbekbergen","year":"1990","unstructured":"Vanbekbergen, P., Catthoor, F., Goossens, G., De Man, H.: Optimized synthesis of asynchronous control circuits from graph-theoretic specifications. In: Proc. ICCAD 1990, pp. 184\u2013187. IEEE Comp. Soc. Press, Los Alamitos (1990)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15928-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:50Z","timestamp":1606185770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15928-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159275","9783642159282"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15928-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}