A graph-theoretic method to identify candidate mechanisms for deriving the rate law of a catalytic reaction

L.T Fan , B Bertók , F Friedler
{"title":"A graph-theoretic method to identify candidate mechanisms for deriving the rate law of a catalytic reaction","authors":"L.T Fan ,&nbsp;B Bertók ,&nbsp;F Friedler","doi":"10.1016/S0097-8485(01)00119-X","DOIUrl":null,"url":null,"abstract":"<div><p>Stoichiometrically, exact candidate pathways or mechanisms for deriving the rate law of a catalytic or complex reaction can be determined through the synthesis of networks of plausible elementary reactions constituting such pathways. A rigorous algorithmic method is proposed for executing this synthesis, which is exceedingly convoluted due to its combinatorial complexity. Such a method for synthesizing networks of reaction pathways follows the general framework of a highly exacting combinatorial method established by us for process-network synthesis. It is based on the unique graph-representation in terms of P-graphs, a set of axioms, and a group of combinatorial algorithms. In the method, the inclusion or exclusion of a step of each elementary reaction in the mechanism of concern hinges on the general combinatorial properties of feasible reaction networks. The decisions are facilitated by solving linear programming problems comprising a set of mass-balance constraints to determine the existence or absence of any feasible solution. The search is accelerated further by exploiting the inferences of preceding decisions, thereby eliminating redundancy. As a result, all feasible independent reaction networks, i.e. pathways, are generated only once; the pathways violating any first principle of either stoichiometry or thermodynamics are eliminated. The method is also capable of generating those combinations of independent pathways directly, which are not microscopically reversible. The efficiency and efficacy of the method are demonstrated with the identification of the feasible mechanisms of ammonia synthesis involving as many as 14 known elementary reactions.</p></div>","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"26 3","pages":"Pages 265-292"},"PeriodicalIF":0.0000,"publicationDate":"2002-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0097-8485(01)00119-X","citationCount":"63","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & chemistry","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S009784850100119X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 63

Abstract

Stoichiometrically, exact candidate pathways or mechanisms for deriving the rate law of a catalytic or complex reaction can be determined through the synthesis of networks of plausible elementary reactions constituting such pathways. A rigorous algorithmic method is proposed for executing this synthesis, which is exceedingly convoluted due to its combinatorial complexity. Such a method for synthesizing networks of reaction pathways follows the general framework of a highly exacting combinatorial method established by us for process-network synthesis. It is based on the unique graph-representation in terms of P-graphs, a set of axioms, and a group of combinatorial algorithms. In the method, the inclusion or exclusion of a step of each elementary reaction in the mechanism of concern hinges on the general combinatorial properties of feasible reaction networks. The decisions are facilitated by solving linear programming problems comprising a set of mass-balance constraints to determine the existence or absence of any feasible solution. The search is accelerated further by exploiting the inferences of preceding decisions, thereby eliminating redundancy. As a result, all feasible independent reaction networks, i.e. pathways, are generated only once; the pathways violating any first principle of either stoichiometry or thermodynamics are eliminated. The method is also capable of generating those combinations of independent pathways directly, which are not microscopically reversible. The efficiency and efficacy of the method are demonstrated with the identification of the feasible mechanisms of ammonia synthesis involving as many as 14 known elementary reactions.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种图论方法,用于确定推导催化反应速率定律的候选机制
从化学计量学上讲,可以通过合成构成这些途径的似是而非的基本反应网络来确定推导催化或复杂反应速率定律的确切候选途径或机制。提出了一种严格的算法方法来执行这种综合,由于其组合的复杂性,它是非常复杂的。这种合成反应途径网络的方法遵循我们为过程-网络合成建立的高度严格的组合方法的一般框架。它基于p图的唯一图表示、一组公理和一组组合算法。在该方法中,所关注的机制中每个基本反应的一个步骤的包含或排除取决于可行反应网络的一般组合特性。通过求解线性规划问题,包括一组质量平衡约束,以确定是否存在任何可行的解决方案,从而促进决策。通过利用先前决策的推断,进一步加快了搜索速度,从而消除了冗余。因此,所有可行的独立反应网络,即途径,只产生一次;违反化学计量学或热力学第一原理的途径被消除。该方法还能够直接产生这些独立途径的组合,这些组合在微观上是不可逆的。该方法的效率和有效性被证明与确定可行的机制氨合成涉及多达14个已知的基本反应。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Instructions to authors Author Index Keyword Index Volume contents New molecular surface-based 3D-QSAR method using Kohonen neural network and 3-way PLS
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1