Affordable Access

Publisher Website

Kind Bigraphs

Authors
Journal
Electronic Notes in Theoretical Computer Science
1571-0661
Publisher
Elsevier
Publication Date
Volume
225
Identifiers
DOI: 10.1016/j.entcs.2008.12.086
Keywords
  • Bigraphs
  • Reactive Systems
  • Sorting
  • Relative Pushouts

Abstract

Abstract We present a refinement, suggested by Jensen and Milner under the term kind, of pure bigraphs. We name the result kind bigraphs. This refinement generalises the notion of atomic and non-atomic controls, allowing a control to contain a subset of the set of controls. We show that this variation has relative pushouts and classify its idem pushouts. A canonical labelled transition system can be derived from this classification and we use known results to reason about bisimilarity on this transition system. We show how kind bigraphs can be used to describe Milner's homomorphic sortings and finally discuss the extra expressivity that parametric kind reaction rules allow.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Bigraphs and Their Algebra

on Electronic Notes in Theoretica... Jan 01, 2008

Stochastic Bigraphs

on Electronic Notes in Theoretica... Jan 01, 2008

Matching of Bigraphs

on Electronic Notes in Theoretica... Jan 01, 2007

Directed Bigraphs

on Electronic Notes in Theoretica... Jan 01, 2007
More articles like this..