图变换的资源约束量化
Resource-Bound Quantification for Graph Transformation
摘要：
图变换已被用于软件工程以及生物化学和生命科学中的并发系统建模。变换规则的应用可以在代数上表征为图范畴中的双推出（DPO）图的构造。我们展示了如何直观的线性逻辑可以扩展与资源约束量化，允许一个隐式处理的DPO条件，以及如何资源逻辑可以用来推理图变换系统。
英文摘要：
Graph transformation has been used to model concurrent systems in software engineering, as well as in biochemistry and life sciences. The application of a transformation rule can be characterised algebraically as construction of a double-pushout (DPO) diagram in the category of graphs. We show how intuitionistic linear logic can be extended with resource-bound quantification, allowing for an implicit handling of the DPO conditions, and how resource logic can be used to reason about graph transformation systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
