Distributed computing: models and methods
Handbook of theoretical computer science (vol. B)
Journal of Computer and System Sciences
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
Automata on Multisets of Communicating Objects
UC '08 Proceedings of the 7th international conference on Unconventional Computing
On stateless multihead automata: hierarchies and the emptiness problem
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Automata and processes on multisets of communicating objects
Natural Computing: an international journal
Hi-index | 0.00 |
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 specifies 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 LBA (linearly bounded automata) 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 some restricted models (namely, B-boundedness and 1-transfer) of RBCS where the reachability problem becomes decidable.