Stochastic generator of chemical structure. 3. Reaction network generation

被引:27
作者
Faulon, JL
Sault, AG
机构
[1] Sandia Natl Labs, Computat Biol & Mat Technol Dept, Albuquerque, NM 87185 USA
[2] Sandia Natl Labs, Catalyt & Porous Mat Dept, Albuquerque, NM 87185 USA
来源
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES | 2001年 / 41卷 / 04期
关键词
D O I
10.1021/ci000029m
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
A new method to generate chemical reaction network is proposed. The particularity of the method is that network generation and mechanism reduction are performed simultaneously using sampling techniques. Our method is tested for hydrocarbon thermal cracking. Results and theoretical arguments demonstrate that our method scales in polynomial time while other deterministic network generators scale in exponential time. This finding offers the possibility of investigating complex reacting systems such as those studied in petroleum refining and combustion.
引用
收藏
页码:894 / 908
页数:15
相关论文
共 25 条
[1]  
ALBRIGHT LF, 1983, PRYOLYSIS THEORY IND
[2]   A COMPILATION OF KINETIC-PARAMETERS FOR THE THERMAL-DEGRADATION OF NORMAL-ALKANE MOLECULES [J].
ALLARA, DL ;
SHAW, R .
JOURNAL OF PHYSICAL AND CHEMICAL REFERENCE DATA, 1980, 9 (03) :523-559
[3]   INFORMATION-THEORY, DISTANCE MATRIX, AND MOLECULAR BRANCHING [J].
BONCHEV, D ;
TRINAJSTIC, N .
JOURNAL OF CHEMICAL PHYSICS, 1977, 67 (10) :4517-4533
[4]   COMPUTER-GENERATED PYROLYSIS MODELING - ON-THE-FLY GENERATION OF SPECIES, REACTIONS, AND RATES [J].
BROADBELT, LJ ;
STARK, SM ;
KLEIN, MT .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 1994, 33 (04) :790-799
[5]   COMPUTER-GENERATION OF REACTION PATHS AND RATE-EQUATIONS IN THE THERMAL-CRACKING OF NORMAL AND BRANCHED PARAFFINS [J].
CLYMANS, PJ ;
FROMENT, GF .
COMPUTERS & CHEMICAL ENGINEERING, 1984, 8 (02) :137-142
[6]  
Corcoran WH, 1983, PYROLYSIS THEORY IND, P47
[7]   KING, A KINETIC NETWORK GENERATOR [J].
DIMAIO, FP ;
LIGNOLA, PG .
CHEMICAL ENGINEERING SCIENCE, 1992, 47 (9-11) :2713-2718
[8]  
Dugundji J., Computers in Chemistry, P19, DOI [DOI 10.1007/BFB0051317, 10.1007/BFb0051317]
[9]  
DUGUNDJI J, 1976, CHEM APPL GRAPH THEO, pCH6
[10]   Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial-time for molecular graphs [J].
Faulon, JL .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1998, 38 (03) :432-444