Learn More
The mobile ambients and the P-systems are models developed in diierent areas of computer science, based on very similar concepts and structures. Given their resemblance, we p o i n t out how to transfer ideas and results from one framework to the other. Along this line, we p r o ve that any P-system can be simulated in ambient calculus. We also introduce(More)
Wireless sensor-actor networks are a recent development of wireless networks where both ordinary sensor nodes and more sophisticated and powerful nodes, called actors, are present. In this paper we formalize a recently introduced algorithm that recovers failed actor communication links via the existing sensor infrastructure. We prove via refinement that the(More)
A reliable approach to designing systems is by applying formal methods, based on logics and set theory. In formal methods refinement based, we develop the system models stepwise, from an abstract level to a concrete one by gradually adding details. Each detail-adding level is proved to still validate the properties of the more abstract level. Due to the(More)
In several state-based approaches to distributed computing, e.g., action systems , or UNITY, the computing nodes are commonly left unspeciied or implicit. For instance, an action system comes with an informal description on how the system is supposed to be mapped into the network. The purpose of this paper is to make this mapping explicit so that, e.g., in(More)