{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:33:28Z","timestamp":1737178408256,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73094-1_14","type":"book-chapter","created":{"date-parts":[[2007,6,30]],"date-time":"2007-06-30T05:53:56Z","timestamp":1183182836000},"page":"204-222","source":"Crossref","is-referenced-by-count":4,"title":["Behaviour-Preserving Transition Insertions in Unfolding Prefixes"],"prefix":"10.1007","author":[{"given":"Victor","family":"Khomenko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35-8","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers\u00a0C-35-8, 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"14_CR2","unstructured":"Chu, T.-A.: Synthesis of Self-Timed VLSI Circuits from Graph-Theoretic Specifications. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology (1987)"},{"issue":"3","key":"14_CR3","first-page":"315","volume":"E80-D","author":"J. Cortadella","year":"1997","unstructured":"Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: PETRIFY: a Tool for Manipulating Concurrent Specifications and Synthesis of Asynchronous Controllers. IEICE Transactions on Information and Systems\u00a0E80-D(3), 315\u2013325 (1997)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"14_CR4","unstructured":"Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Automatic Handshake Expansion and Reshuffling Using Concurrency Reduction. In: Proc. HWPN\u201998, pp. 86\u2013110 (1998)"},{"key":"14_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-55989-1","volume-title":"Logic Synthesis of Asynchronous Controllers and Interfaces","author":"J. Cortadella","year":"2002","unstructured":"Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Logic Synthesis of Asynchronous Controllers and Interfaces. Springer, Heidelberg (2002)"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"20","author":"J. Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An Improvement of McMillan\u2019s Unfolding Algorithm. Formal Methods in System Design\u00a020(3), 285\u2013310 (2002)","journal-title":"Formal Methods in System Design"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Heljanko, K.: Deadlock and Reachability Checking with Finite Complete Prefixes. Technical Report A56, Laboratory for Theoretical Computer Science, Helsinki University of Technology (1999)","DOI":"10.1007\/3-540-44618-4_10"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. PhD thesis, School of Computing Science, Newcastle University (2003)","DOI":"10.1007\/3-540-45657-0_49"},{"key":"14_CR9","unstructured":"Khomenko, V.: Behaviour-Preserving Transition Insertions in Unfolding Prefixes. Technical Report CS-TR-952, School of Computing Science, Newcastle University (2006) URL: http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/papers\/papers.html"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Khomenko, V.: Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings. Technical Report CS-TR-995, School of Computing Science, Newcastle University (2007) URL: http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/papers\/papers.html","DOI":"10.1109\/ACSD.2007.48"},{"issue":"2","key":"14_CR11","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 Informatica\u00a040(2), 95\u2013118 (2003)","journal-title":"Acta Informatica"},{"issue":"2","key":"14_CR12","first-page":"1","volume":"62","author":"V. Khomenko","year":"2004","unstructured":"Khomenko, V., Koutny, M., Yakovlev, A.: Detecting State Coding Conflicts in STG Unfoldings Using SAT. Fundamenta Informaticae\u00a062(2), 1\u201321 (2004)","journal-title":"Fundamenta Informaticae"},{"issue":"1\u20132","key":"14_CR13","first-page":"49","volume":"70","author":"V. Khomenko","year":"2006","unstructured":"Khomenko, V., Koutny, M., Yakovlev, A.: Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT. Fundamenta Informaticae\u00a070(1\u20132), 49\u201373 (2006)","journal-title":"Fundamenta Informaticae"},{"issue":"5","key":"14_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1049\/ip-cdt:20030831","volume":"150","author":"A. Madalinski","year":"2003","unstructured":"Madalinski, A., Bystrov, A., Khomenko, V., Yakovlev, A.: Visualization and Resolution of Coding Conflicts in Asynchronous Circuit Design. IEE Proceedings: Computers and Digital Techniques\u00a0150(5), 285\u2013293 (2003)","journal-title":"IEE Proceedings: Computers and Digital Techniques"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Murata, T.: Petri Nets: Properties, Analysis and Applications. In: Proc. of the IEEE, 7(4):541\u2013580 (1989)","DOI":"10.1109\/5.24143"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/3-540-65306-6_19","volume-title":"Lectures on Petri Nets I: Basic Models","author":"M. Silva","year":"1998","unstructured":"Silva, M., Teruel, E., Colom, J.M.: Linear Algebraic and Linear Programming Techniques for the Analysis of Place\/Transition Net Systems. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. LNCS, vol.\u00a01491, pp. 309\u2013373. Springer, Heidelberg (1998)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","volume-title":"Lectures on Petri Nets I: Basic Models","author":"A. Valmari","year":"1998","unstructured":"Valmari, A.: The State Explosion Problem. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. LNCS, vol.\u00a01491, pp. 429\u2013528. Springer, Heidelberg (1998)"},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00122081","volume":"9","author":"A. Yakovlev","year":"1996","unstructured":"Yakovlev, A., Lavagno, L., Sangiovanni-Vincentelli, A.: A Unified Signal Transition Graph Model for Asynchronous Control Circuit Synthesis. Formal Methods in System Design\u00a09(3), 139\u2013188 (1996)","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73094-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T00:53:11Z","timestamp":1737161591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73094-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730934"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73094-1_14","relation":{},"subject":[]}}