使用 Bigraphs 建立实用模型

arXiv - CS - Symbolic Computation Pub Date : 2024-05-31 DOI:arxiv-2405.20745

Blair Archibald, Muffy Calder, Michele Sevegnani

{"title":"使用 Bigraphs 建立实用模型","authors":"Blair Archibald, Muffy Calder, Michele Sevegnani","doi":"arxiv-2405.20745","DOIUrl":null,"url":null,"abstract":"Bigraphs are a versatile modelling formalism that allows easy expression of\nplacement and connectivity relations in a graphical format. System evolution is\nuser defined as a set of rewrite rules. This paper presents a practical, yet\ndetailed guide to developing, executing, and reasoning about bigraph models,\nincluding recent extensions such as parameterised, instantaneous, prioritised\nand conditional rules, and probabilistic and stochastic rewriting.","PeriodicalId":501033,"journal":{"name":"arXiv - CS - Symbolic Computation","volume":"3 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Practical Modelling with Bigraphs\",\"authors\":\"Blair Archibald, Muffy Calder, Michele Sevegnani\",\"doi\":\"arxiv-2405.20745\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bigraphs are a versatile modelling formalism that allows easy expression of\\nplacement and connectivity relations in a graphical format. System evolution is\\nuser defined as a set of rewrite rules. This paper presents a practical, yet\\ndetailed guide to developing, executing, and reasoning about bigraph models,\\nincluding recent extensions such as parameterised, instantaneous, prioritised\\nand conditional rules, and probabilistic and stochastic rewriting.\",\"PeriodicalId\":501033,\"journal\":{\"name\":\"arXiv - CS - Symbolic Computation\",\"volume\":\"3 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Symbolic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2405.20745\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.20745","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

Bigraphs 是一种通用的建模形式，可以用图形格式轻松表达位置和连接关系。系统演化被用户定义为一组重写规则。本文介绍了开发、执行和推理 bigraph 模型的实用而详细的指南，包括最近的扩展，如参数化、瞬时、优先和条件规则，以及概率和随机重写。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Practical Modelling with Bigraphs

Bigraphs are a versatile modelling formalism that allows easy expression of placement and connectivity relations in a graphical format. System evolution is user defined as a set of rewrite rules. This paper presents a practical, yet detailed guide to developing, executing, and reasoning about bigraph models, including recent extensions such as parameterised, instantaneous, prioritised and conditional rules, and probabilistic and stochastic rewriting.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Symbolic Computation

自引率

0.00%

发文量