Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing

Authors:
Linmin Yang;Zhe Dang;Oscar H. Ibarra
Affiliations:
School of Electrical Engineering and Computer Science, Washington State University, Pullman, USA 99164;School of Electrical Engineering and Computer Science, Washington State University, Pullman, USA 99164;Department of Computer Science, University of California, Santa Barbara, USA 93106
Venue:
Natural Computing: an international journal
Year:
2010

Citing 7
Cited 0

Distributed computing: models and methods

Handbook of theoretical computer science (vol. B)
Computing with membranes

Journal of Computer and System Sciences
Tissue P systems

Theoretical Computer Science
Smart home – digitally engineered domestic life

Personal and Ubiquitous Computing
PICO: A Middleware Framework for Pervasive Computing

IEEE Pervasive Computing
Context-Aware Computing Applications

WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
The power of maximal parallelism in p systems

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Targeting at modeling the high-level dynamics of pervasive computing systems, we introduce bond computing systems (BCS) consisting of objects, bonds and rules. Objects are typed but addressless representations of physical or logical (computing and communicating) entities. Bonds are typed multisets of objects. In a BCS, a configuration is specified by a multiset of bonds, called a collection. Rules specify how a collection evolves to a new one. A BCS is a variation of a P system introduced by Gheorghe Paun where, roughly, there is no maximal parallelism but with typed and unbounded number of membranes, and hence, our model is also biologically inspired. In this paper, we focus on regular bond computing systems (RBCS), where bond types are regular, and study their computation power and verification problems. Among other results, we show that the computing power of RBCS lies between linearly bounded automata (LBA) and LBC (a form of bounded multicounter machines) and hence, the regular bond-type reachability problem (given an RBCS, whether there is some initial collection that can reach some collection containing a bond of a given regular type) is undecidable. We also study a restricted model (namely, B-boundedness) of RBCS where the reachability problem becomes decidable.