Probabilistic Bigraphs

IF 1.4 4区计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Formal Aspects of Computing Pub Date : 2022-09-19 DOI:https://dl.acm.org/doi/10.1145/3545180

Blair Archibald, Muffy Calder, Michele Sevegnani

引用次数: 0

Abstract

Bigraphs are a universal computational modelling formalism for the spatial and temporal evolution of a system in which entities can be added and removed. We extend bigraphs to probabilistic bigraphs, and then again to action bigraphs, which include non-determinism and rewards. The extensions are implemented in the BigraphER toolkit and illustrated through examples of virus spread in computer networks and data harvesting in wireless sensor systems. BigraphER also supports the existing stochastic bigraphs extension of Krivine et al. and using BigraphER we give, for the first time, a direct implementation of the membrane budding model used to motivate stochastic bigraphs.

查看原文本刊更多论文

概率Bigraphs

图形是一种通用的计算建模形式，用于系统的空间和时间演化，其中可以添加和删除实体。我们将图扩展到概率图，然后再扩展到行动图，其中包括非确定性和奖励。这些扩展在BigraphER工具包中实现，并通过计算机网络中的病毒传播和无线传感器系统中的数据收集示例进行说明。BigraphER还支持Krivine等人现有的随机图形扩展，并且我们首次使用BigraphER直接实现了用于激发随机图形的膜出芽模型。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Formal Aspects of Computing 工程技术-计算机：软件工程

CiteScore

3.30

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： This journal aims to publish contributions at the junction of theory and practice. The objective is to disseminate applicable research. Thus new theoretical contributions are welcome where they are motivated by potential application; applications of existing formalisms are of interest if they show something novel about the approach or application. In particular, the scope of Formal Aspects of Computing includes: well-founded notations for the description of systems; verifiable design methods; elucidation of fundamental computational concepts; approaches to fault-tolerant design; theorem-proving support; state-exploration tools; formal underpinning of widely used notations and methods; formal approaches to requirements analysis.