{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:04:05Z","timestamp":1747544645733,"version":"3.30.1"},"reference-count":42,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s1383-7621(02)00094-2","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T22:18:26Z","timestamp":1034115506000},"page":"99-112","source":"Crossref","is-referenced-by-count":12,"title":["Genetic engineering versus natural evolution"],"prefix":"10.1016","volume":"48","author":[{"given":"Lech","family":"J\u00f3\u017awiak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Postu\u0142a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S1383-7621(02)00094-2_BIB1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1049\/ip-cdt:19951885","article-title":"State assignment of finite state machines using a genetic algorithm","volume":"142","author":"Almaini","year":"1995","journal-title":"IEE Proceedings\u2013\u2013Computers and Digital Techniques"},{"issue":"2","key":"10.1016\/S1383-7621(02)00094-2_BIB2","first-page":"58","article-title":"An overview of genetic algorithms\u2013\u2013Part 1: Fundamentals","volume":"15","author":"Beasley","year":"1993","journal-title":"University Computing"},{"issue":"4","key":"10.1016\/S1383-7621(02)00094-2_BIB3","first-page":"170","article-title":"An overview of genetic algorithms\u2013\u2013Part 2: Research topics","volume":"15","author":"Beasley","year":"1993","journal-title":"University Computing"},{"issue":"1","key":"10.1016\/S1383-7621(02)00094-2_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1080\/00207219408925911","article-title":"GAP: a genetic algorithm to optimize two-bit decoder PLAs","volume":"76","author":"Benten","year":"1994","journal-title":"International Journal of Electronics"},{"year":"1990","series-title":"Boolean Reasoning","author":"Brown","key":"10.1016\/S1383-7621(02)00094-2_BIB5"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB6","unstructured":"S.-C. Chang, M. Marek-Sadowska, BDD Representation of Incompletely Specified Functions, International Workshop on Logic Synthesis, Granlibakken Conference Center, Iahoe City, CA, USA, 23\u201326 May 1993, IWLS'93 Workshop Notes, pp. P6c-1\u2013P6c-5"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB7","series-title":"Proceedings on International Conference on VLSI Design","first-page":"522","article-title":"Genetic algorithm based approach for integrated state assignment and flipflop selection in finite state machine synthesis","author":"Chattopadhyay","year":"1997"},{"issue":"17","key":"10.1016\/S1383-7621(02)00094-2_BIB8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0167-9260(94)00007-7","article-title":"Two-level logic minimization: an overview","author":"Coudert","year":"1994","journal-title":"Integration: The VLSI Journal"},{"year":"1978","series-title":"Logic Design of Digital Systems","author":"Dietmeyer","key":"10.1016\/S1383-7621(02)00094-2_BIB9"},{"year":"1991","series-title":"Handbook of Genetic Algorithms","author":"Davis","key":"10.1016\/S1383-7621(02)00094-2_BIB10"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB11","unstructured":"K.M. Dill and M.A. Perkowski, Evolutionary minimization of generalized Reed\u2013Muller forms. in: Proceedings of ICCIMA'98 Conference, February 1998, Melbourne, Australlia, World Scientific, pp. 727\u2013733"},{"issue":"6","key":"10.1016\/S1383-7621(02)00094-2_BIB12","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/S1383-7621(00)00060-6","article-title":"Baldwinian learning utilizing genetic andheuristic algorithms for logic synthesis and minimization of incompletely specified data with generalized Reed\u2013Muller (AND-EXOR) forms","volume":"47","author":"Dill","year":"2001","journal-title":"Journal of Systems Architecture"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB13","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0022-5193(62)90036-X","article-title":"Simulation of genetic systems","author":"Fraser","year":"1962","journal-title":"Journal of Theoretical Biology"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB14","doi-asserted-by":"crossref","unstructured":"M. Fujita, Y. Matsunaga, Multi-level Logic Minimization based on Minimal Support and its Application to the Minimization of Look-up Table Type FPGAs, in: 1991 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers, 1991, pp. 560\u2013563","DOI":"10.1109\/ICCAD.1991.185332"},{"year":"1979","series-title":"Computers and Intractability. A Guide to the Theory of NPCompleteness","author":"Garey","key":"10.1016\/S1383-7621(02)00094-2_BIB15"},{"year":"1989","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","key":"10.1016\/S1383-7621(02)00094-2_BIB16"},{"issue":"5","key":"10.1016\/S1383-7621(02)00094-2_BIB17","first-page":"16","article-title":"Selection criterion for a potentially inessential argument to be eliminated form an incompletely-specified logical function","volume":"9","author":"Grinshpon","year":"1975","journal-title":"Automatic Control and Computer Sciences"},{"issue":"11","key":"10.1016\/S1383-7621(02)00094-2_BIB18","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1109\/TC.1978.1674997","article-title":"Irredundant normal forms and minimal dependence sets of a Boolean function","volume":"C-27","author":"Halatsis","year":"1978","journal-title":"IEEE Transactions on Computers"},{"issue":"8","key":"10.1016\/S1383-7621(02)00094-2_BIB19","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/T-C.1971.223372","article-title":"Minimal input solutions","volume":"C-20","author":"Hight","year":"1971","journal-title":"IEEE Transactions on Computers"},{"year":"1975","series-title":"Adaptation in Natural and Artificial Systems: an Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"Holland","key":"10.1016\/S1383-7621(02)00094-2_BIB20"},{"year":"1995","series-title":"Hidden Order: How Adaptation Builds Complexity","author":"Holland","key":"10.1016\/S1383-7621(02)00094-2_BIB21"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB22","doi-asserted-by":"crossref","unstructured":"K. Jasinski, T. Luba, J. Kalinowski, Parallel Decomposition in Logic Synthesis, in: 15th European Solid-State Circuits Conference, September 1989, pp. 113\u2013116","DOI":"10.1109\/ESSCIRC.1989.5468151"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB23","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/0165-6074(91)90417-R","article-title":"An efficient method for the sequential general decomposition of sequential machines","volume":"32","author":"J\u00f3\u017awiak","year":"1991","journal-title":"Microprocessing and Microprogramming"},{"issue":"1","key":"10.1016\/S1383-7621(02)00094-2_BIB24","doi-asserted-by":"crossref","DOI":"10.1142\/S0218126692000027","article-title":"An efficient heuristic method for state assignment of large sequential machines","volume":"2","author":"J\u00f3\u017awiak","year":"1992","journal-title":"Journal of Circuits, Systems and Computers"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB25","doi-asserted-by":"crossref","unstructured":"L. J\u00f3\u017awiak, F. Volf, An efficient method for decomposition of multiple output Boolean functions and assigned sequential machines, in: EDAC The European Conference on Design Automation, Brussels, 16\u201319 March 1992, pp. 114\u2013122","DOI":"10.1109\/EDAC.1992.205905"},{"issue":"3\u20134","key":"10.1016\/S1383-7621(02)00094-2_BIB26","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1155\/1995\/16259","article-title":"General decomposition and its use in digital circuit synthesis","volume":"3","author":"J\u00f3\u017awiak","year":"1995","journal-title":"VLSI Design"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB27","unstructured":"L. J\u00f3\u017awiak, P.A. Konieczny, Input support minimization for efficient PLD and FPGA synthesis, in: IWLAS'96, Grenoble France, 16\u201318 December 1996, pp. 30\u201337"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB28","unstructured":"L. J\u00f3\u017awiak, N. Ederveen, Genetic algorithm for input support minimization, in: proceedings of ICCIMA'98\u2013\u2013International Conference on Computational Intelligence and Multimedia Applications, Gippsland, Victoria, Australia, 9\u201311 December 1998; ISBN 981-02-3352-3, World Scientific Publ. Co., Singapore, 1998, pp. 765\u2013777"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB29","unstructured":"L. J\u00f3\u017awiak, Information Relationships and Measures in Application to Logic Design, IEEE International Symposium on Multiple-Valued Logic, Freiburg Im Breisgau, Germany, May 20-22 (1999)"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB30","doi-asserted-by":"crossref","unstructured":"L. J\u00f3\u017awiak, A. Chojnacki, Functional decomposition based on information relationship measures extremely effective for symmetric functions, in: 25th EUROMICRO Conference, Milan, Italy, 8\u201310 September 1999; IEEE Computer Society Press, Los Alamitos, CA, USA, 1999, pp. 150\u2013160","DOI":"10.1109\/EURMIC.1999.794461"},{"issue":"9","key":"10.1016\/S1383-7621(02)00094-2_BIB31","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1109\/TC.1979.1675428","article-title":"Logic design of programmable logic arrays","volume":"C-28","author":"Kambayashi","year":"1979","journal-title":"IEEE Transaction on Computers"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB32","first-page":"277","article-title":"Exact redundant state registers removal based on binary decision diagrams","author":"Lin","year":"1992","journal-title":"IFIP Transactions A (Computer Science and Technology)"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB33","doi-asserted-by":"crossref","unstructured":"B. Lin, Efficient symbolic support manipulation, in: ICCD, October 1993, pp. 513\u2013516","DOI":"10.1109\/ICCD.1993.393324"},{"year":"1997","series-title":"Rough Sets and Data Mining\u2013\u2013Analysis of Impresise Data","key":"10.1016\/S1383-7621(02)00094-2_BIB34"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB35","series-title":"Foundation of Genetic Algorithms 2","first-page":"141","article-title":"Syntactic analysis of convergence in genetic algorithms","author":"Louis","year":"1992"},{"issue":"3","key":"10.1016\/S1383-7621(02)00094-2_BIB36","first-page":"313","article-title":"Algorithm of elimination of attributes and arguments based on unate complement concept","volume":"40","author":"Luba","year":"1992","journal-title":"Bulletin of the Polish Academy of Sciences"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB37","series-title":"Intelligent Decision Support","article-title":"Rough sets and some aspects of logic synthesis","author":"Luba","year":"1992"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB38","unstructured":"A. Mishchenko, C. Files, M. Perkowski, B. Steinbach, Ch. Dorotska, Implicit algorithms for multi-valued input support manipulation, in: Proceedings of 4th International Workshop on Boolean Problems, September 2000, Freiberg, Germany"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB39","unstructured":"R. Rudell, Logic Synthesis for VLSI Design, Ph.D. dissertation, University of California, Berkeley, USA, April 1989; Tech. Rep. UCB\/ERL M89\/49"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB40","series-title":"ICCAD","first-page":"353","article-title":"Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization","author":"Sawada","year":"1995"},{"key":"10.1016\/S1383-7621(02)00094-2_BIB41","series-title":"Foundation of Genetic Algorithms 2","first-page":"243","article-title":"Simulated crossover in genetic algorithms","author":"Syswerda","year":"1992"},{"issue":"3\u20134","key":"10.1016\/S1383-7621(02)00094-2_BIB42","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1155\/1995\/19823","article-title":"Division-based versus general decomposition-based multiple-level logic synthesis","volume":"3","author":"Volf","year":"1995","journal-title":"VLSI Design"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762102000942?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762102000942?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T21:58:36Z","timestamp":1733781516000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762102000942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":42,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S1383762102000942"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(02)00094-2","relation":{},"ISSN":["1383-7621"],"issn-type":[{"type":"print","value":"1383-7621"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}