{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T14:59:24Z","timestamp":1758121164484},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,8,12]],"date-time":"2009-08-12T00:00:00Z","timestamp":1250035200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s00236-009-0102-y","type":"journal-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T10:46:09Z","timestamp":1249987569000},"page":"433-474","source":"Crossref","is-referenced-by-count":12,"title":["STG decomposition strategies in combination with unfolding"],"prefix":"10.1007","volume":"46","author":[{"given":"Victor","family":"Khomenko","sequence":"first","affiliation":[]},{"given":"Mark","family":"Schaefer","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Wollowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,12]]},"reference":[{"key":"102_CR1","doi-asserted-by":"crossref","unstructured":"Berkel, K.V.: Handshake circuits: an asynchronous architecture for VLSI programming. In: Cambridge International Series on Parallel Computation, vol. 5. Cambridge University Press, Cambridge (1993)","DOI":"10.1017\/CBO9780511585777"},{"key":"102_CR2","doi-asserted-by":"crossref","unstructured":"Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W. et\u00a0al., (eds.) Petri Nets: Central Models and their Properties. Lecturer Notes in Computer Science, vol. 254, pp. 359\u2013376. Springer, Berlin (1987)","DOI":"10.1007\/978-3-540-47919-2_13"},{"key":"102_CR3","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 Trans. Comput. C-35-8, 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"102_CR4","unstructured":"Carmona, J.: Structural methods for the synthesis of well-formed concurrent specifications. PhD thesis, Universitat Polit\u00e8cnica de Catalunya (2003)"},{"key":"102_CR5","doi-asserted-by":"crossref","unstructured":"Carmona, J., Cortadella, J.: ILP models for the synthesis of asynchronous control circuits. In: Proceedings of IEEE\/ACM International Conference on Computer Aided Design, pp. 818\u2013825 (2003)","DOI":"10.1109\/ICCAD.2003.159771"},{"key":"102_CR6","doi-asserted-by":"crossref","unstructured":"Carmona, J., Cortadella, J.: State encoding of large asynchronous controllers. In: Proceedings of DAC\u201906 IEEE, pp. 939\u2013944 (2006)","DOI":"10.1145\/1146909.1147148"},{"key":"102_CR7","unstructured":"Chu, T.-A.: Synthesis of self-timed VLSI circuits from graph-theoretic specifications. PhD thesis, MIT (1987)"},{"key":"102_CR8","first-page":"315","volume":"3","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 Trans. Inf. Sys. E80-D 3, 315\u2013325 (1997)","journal-title":"IEICE Trans. Inf. Sys. E80-D"},{"key":"102_CR9","volume-title":"Logic Synthesis of Asynchronous Controllers and Interfaces","author":"J. Cortadella","year":"2000","unstructured":"Cortadella J., Kishinevsky M., Kondratyev A., Lavagno L., Yakovlev A: Logic Synthesis of Asynchronous Controllers and Interfaces. Springer, Berlin (2000)"},{"issue":"1","key":"102_CR10","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1093\/comjnl\/45.1.12","volume":"45","author":"D. Edwards","year":"2002","unstructured":"Edwards D., Bardsley A.: Balsa: an asynchronous hardware synthesis language. Comput. J. 45(1), 12\u201318 (2002)","journal-title":"Comput. J."},{"issue":"3","key":"102_CR11","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 20(3), 285\u2013310 (2002)","journal-title":"FMSD"},{"key":"102_CR12","unstructured":"International Technology Roadmap for Semiconductors.: Design. (2005). URL: www.itrs.net\/Links\/2005ITRS\/Design2005.pdf"},{"key":"102_CR13","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":"102_CR14","doi-asserted-by":"crossref","unstructured":"Khomenko, V.: Efficient automatic resolution of encoding conflicts using STG unfoldings. In: Basten, T., Shukla, S. (eds.) ACSD \u201907, IEEE, pp. 137\u2013146 (2007)","DOI":"10.1109\/ACSD.2007.48"},{"key":"102_CR15","doi-asserted-by":"crossref","unstructured":"Khomenko, V., Schaefer, M.: Combining decomposition and unfolding for STG synthesis. In: ATPN \u201907: Applications and Theory of Petri Nets and Other Models of Concurrency. Lecturer Notes in Computer Science, vol. 4024, pp. 223\u2013243 (2007)","DOI":"10.1007\/978-3-540-73094-1_15"},{"issue":"2","key":"102_CR16","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. Fundam. Inform. 62(2), 1\u201321 (2004)","journal-title":"Fundam. Inform."},{"issue":"1\u20132","key":"102_CR17","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. Fundam. Inform. 70(1\u20132), 49\u201373 (2006)","journal-title":"Fundam. Inform."},{"issue":"4","key":"102_CR18","doi-asserted-by":"crossref","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. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"102_CR19","unstructured":"Schaefer, M.: DesiJ\u2014a tool for decomposition. Technical Report 2007\u201311, University of Augsburg (2007). http:\/\/www.informatik.uni-augsburg.de\/de\/forschung\/reports\/"},{"key":"102_CR20","doi-asserted-by":"crossref","unstructured":"Schaefer, M., Vogler, W.: Component refinement and CSC solving for STG decomposition. In: Vladimiro, S. (ed.) FOSSACS \u201905, Lecturer Notes in Computer Science, vol. 3441, pp. 348\u2013363. Springer, New York (2005)","DOI":"10.1007\/978-3-540-31982-5_22"},{"key":"102_CR21","doi-asserted-by":"crossref","unstructured":"Schaefer, M., Vogler, W., Jan\u010dar, P.: Determinate STG decomposition of marked graphs. In: Ciardo, G., Darondeau, P. (eds.) ATPN \u201905, Lecturer Notes in Computer Science, vol. 3536, pp. 365\u2013384. Springer (2005)","DOI":"10.1007\/11494744_21"},{"key":"102_CR22","doi-asserted-by":"crossref","unstructured":"Schaefer, M., Vogler, W., Wollowski, R., Khomenko, V.: Strategies for optimised STG decomposition. In: ACSD \u201906, pp. 123\u2013132 (2006)","DOI":"10.1109\/ACSD.2006.30"},{"key":"102_CR23","doi-asserted-by":"crossref","unstructured":"Schaefer, M., Vogler, W., Wist, D., Wollowski, R.: Avoiding irreducible csc conflicts by internal communication. In: ACSD \u201908, pp. 3\u201312 (2008)","DOI":"10.1109\/ACSD.2008.4574588"},{"key":"102_CR24","unstructured":"Semenov, A.: Verification and synthesis of asynchronous control circuits using petri net unfolding. PhD thesis, School of Computing Science, Newcastle University (1997)"},{"key":"102_CR25","doi-asserted-by":"crossref","unstructured":"Valmari, A.: The state explosion problem. In: Lectures on Petri Nets I: Basic Models, vol. 1491, pp. 429\u2013528. Springer, New York (1998)","DOI":"10.1007\/3-540-65306-6_21"},{"key":"102_CR26","first-page":"161","volume":"76","author":"W. Vogler","year":"2006","unstructured":"Vogler W., Kangsah B.: Improved decomposition of signal transition graphs. Fundam. Inform. 76, 161\u2013197 (2006)","journal-title":"Fundam. Inform."},{"key":"102_CR27","doi-asserted-by":"crossref","unstructured":"Vogler, W., Wollowski, R.: Decomposition in asynchronous circuit design. In: Cortadella, J. et\u00a0al., (eds.) Concurrency and Hardware Design, Lecture Notes on Computer Science, vol. 2549, pp. 152\u2013190. Springer, Berlin (2002)","DOI":"10.1007\/3-540-36190-1_5"},{"key":"102_CR28","doi-asserted-by":"crossref","unstructured":"Yoneda, T., Onda, H., Myers, C.: Synthesis of speed independent circuits based on decomposition. In: ASYNC \u201904, IEEE, pp. 135\u2013145 (2004)","DOI":"10.1109\/ASYNC.2004.1299295"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0102-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-009-0102-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0102-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T09:45:24Z","timestamp":1590054324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-009-0102-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,12]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["102"],"URL":"https:\/\/doi.org\/10.1007\/s00236-009-0102-y","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,12]]}}}