| 翻訳と辞書 |
Bigraph
A bigraph (often used in the plural bigraphs) can be modelled as the superposition of a graph (the ''link graph'') and a set of trees (the ''place graph'').〔''(A Brief Introduction To Bigraphs )'', IT University of Copenhagen, Denmark.〕〔Milner, Robin. ''(The Bigraphical Model )'', University of Cambridge Computer Laboratory, UK.〕
Each node of the bigraph is part of a graph and also part of some tree that describes how the nodes are nested. Bigraphs can be conveniently and formally displayed as diagrams.〔 They have applications in the modelling of distributed systems for ubiquitous computing and can be used to describe mobile interactions. They have also been used by Robin Milner in an attempt to subsume Calculus of Communicating Systems (CCS) and π-calculus.〔 They have been studied in the context of category theory.
==Anatomy of a bigraph==
Aside from nodes and (hyper-)edges, a bigraph may have associated with it one or more ''regions'' which are roots in the place forest, and zero or more ''holes'' in the place graph, into which other bigraph regions may be inserted. Similarly, to nodes we may assign ''controls'' that define identities and an arity (the number of ''ports'' for a given node to which link-graph edges may connect). These controls are drawn from a bigraph ''signature''. In the link graph we define ''inner'' and ''outer'' names, which define the connection points at which coincident names may be fused to form a single link.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Bigraph」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|