In this paper we show how state-of-the art SMT-based techniques for software verification can be employed in the verification of event–condition–action rules in intelligent environments. Moreover, we exploit the specific features of intelligent environments to optimise the verification process. We compare our approach with previous work in a detailed evaluation section, showing how it improves both performance and expressivity of the language for event–condition–action rules

The simulation and visualization of biological system models is becoming more and more important both in clinical use and in basic research. Since many systems are characterized by interactions involving different scales at the same time, several approaches have been defined to handle such complex systems at different spatial and temporal scale. In this context, we propose BioShape, a 3D particle-based spatial simulator whose novelty\ud consists of providing a uniform and geometry-oriented multiscale modeling environment.\ud These features make BioShape "scale-independent'', able to\ud express geometric and positional information, and able to support transformations between scales simply defined as mappings between different granularity model instances. To highlight BioShape peculiarities, we sketch a multiscale model of human aortic valve where shapes are used at the cell scale for describing\ud the interaction between a single valvular interstitial cell and its surrounding matrix, at the tissue scale for modeling the valve leaflet tissue mechanical behaviour, and at the organ scale for reproducing, as a 3D structure with fluid-structure interaction, the\ud motion of the valve, blood, and surrounding tissue

No abstract

In [24] the authors studied the expressiveness of persistence in the asynchronous π-calculus (Aπ) wrt weak barbed congruence. The study is incomplete because it ignores the issue of divergence. In this paper, we present an expressiveness study of persistence in the asynchronous π-calculus (Aπ) wrt De Nicola and Hennessy's testing scenario which is sensitive to divergence. Following [24], we consider Aπ and three sub-languages of it, each capturing one source of persistence: the persistent-input calculus (PIAπ), the persistent-output calculus (POAπ) and persistent calculus (PAπ). In [24] the authors showed encodings from Aπ into the semi-persistent calculi (i.e., POAπ and PIAπ) correct wrt weak barbed congruence. In this paper we prove that, under some general conditions, there cannot be an encoding from Aπ into a (semi)-persistent calculus preserving the must testing semantics.

The pi-calculus, its asynchronous version and Boudol's mapping from the former language to the latter one are well-known mathematical objects in theoretical computer science. It is also well-known that the mapping is not fully-abstract w.r.t. most of the semantics defined over these two languages. In this paper we study and fix conditions on the existence of fully-abstract results for Boudol's mapping (and its variants). The testing theories \`a la De Nicola-Hennessy turned out to be very useful tools for such a purpose

Due to the huge volume and complexity of biological data available today, a fundamental component of biomedical research is now in silico analysis. This includes modelling and simulation of biological systems and processes, as well as automated bioinformatics analysis of high-throughput data. The quest for bioinformatics resources (including databases, tools, and knowledge) becomes therefore of extreme importance. Bioinformatics itself is in rapid evolution and dedicated Grid cyberinfrastructures already offer easier access and sharing of resources. Furthermore, the concept of the Grid is progressively interleaving with those of Web Services, semantics, and software agents. Agent-based systems can play a key role in learning, planning, interaction, and coordination. Agents constitute also a natural paradigm to engineer simulations of complex systems like the molecular ones. We present here an agent-based, multilayer architecture for bioinformatics Grids. It is intended to support both the execution of complex in silico experiments and the simulation of biological systems. In the architecture a pivotal role is assigned to an "alive" semantic index of resources, which is also expected to facilitate users' awareness of the bioinformatics domain.

No abstract

International audienceOne of the early results about the asynchronous $\pi$-calculus which significantly contributed to its popularity is the capability of encoding the output prefix of the (choiceless) $\pi$-calculus in a natural and elegant way. Encodings of this kind were proposed by Honda and Tokoro, by Nestmann and (independently) by Boudol. We investigate whether the above encodings preserve De Nicola and Hennessy's testing semantics. In this sense, it turns out that, under some general conditions, no encoding of output prefix is able to preserve the must testing. This negative result is due to (a) the non atomicity of the sequences of steps which are necessary in the asynchronous $\pi$-calculus to mimic synchronous communication, and (b) testing semantics's sensitivity to divergence