Predicting global usages of resources endowed with local policies

The effective usages of computational resources are a primary concern of up-to-date distributed applications. In this paper, we present a methodology to reason about resource usages (acquisition, release, revision, ...), and therefore the proposed approach enables to predict bad usages of resources. Keeping in mind the interplay between local and global information occurring in the application-resource interactions, we model resources as entities with local policies and global properties governing the overall interactions. Formally, our model takes the shape of an extension of pi-calculus with primitives to manage resources. We develop a Control Flow Analysis computing a static approximation of process behaviour and therefore of the resource usages.Comment: In Proceedings FOCLASA 2011, arXiv:1107.584

Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca

In this paper we propose an extension of the Rebeca language that can be used to model distributed and asynchronous systems with timing constraints. We provide the formal semantics of the language using Structural Operational Semantics, and show its expressiveness by means of examples. We developed a tool for automated translation from timed Rebeca to the Erlang language, which provides a first implementation of timed Rebeca. We can use the tool to set the parameters of timed Rebeca models, which represent the environment and component variables, and use McErlang to run multiple simulations for different settings. Timed Rebeca restricts the modeller to a pure asynchronous actor-based paradigm, where the structure of the model represents the service oriented architecture, while the computational model matches the network infrastructure. Simulation is shown to be an effective analysis support, specially where model checking faces almost immediate state explosion in an asynchronous setting.Comment: In Proceedings FOCLASA 2011, arXiv:1107.584

Parameterized Verification of Safety Properties in Ad Hoc Network Protocols

We summarize the main results proved in recent work on the parameterized verification of safety properties for ad hoc network protocols. We consider a model in which the communication topology of a network is represented as a graph. Nodes represent states of individual processes. Adjacent nodes represent single-hop neighbors. Processes are finite state automata that communicate via selective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For this model we consider a decision problem that can be expressed as the verification of the existence of an initial topology in which the execution of the protocol can lead to a configuration with at least one node in a certain state. The decision problem is parametric both on the size and on the form of the communication topology of the initial configurations. We draw a complete picture of the decidability and complexity boundaries of this problem according to various assumptions on the possible topologies.Comment: In Proceedings PACO 2011, arXiv:1108.145

Decoupled execution of synchronous coordination models via behavioural automata

Synchronous coordination systems allow the exchange of data by logically indivisible actions involving all coordinated entities. This paper introduces behavioural automata, a logically synchronous coordination model based on the Reo coordination language, which focuses on relevant aspects for the concurrent evolution of these systems. We show how our automata model encodes the Reo and Linda coordination models and how it introduces an explicit predicate that captures the concurrent evolution, distinguishing local from global actions, and lifting the need of most synchronous models to involve all entities at each coordination step, paving the way to more scalable implementations.Comment: In Proceedings FOCLASA 2011, arXiv:1107.584

Towards reduction of Paradigm coordination models

The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component dynamics are consistently specified at a detailed and a global level of abstraction. To enable automated verification of Paradigm models, a translation of Paradigm into process algebra has been defined in previous work. In this paper we investigate, guided by a client-server example, reduction of Paradigm models based on a notion of global inertness. Representation of Paradigm models as process algebraic specifications helps to establish a property-preserving equivalence relation between the original and the reduced Paradigm model. Experiments indicate that in this way larger Paradigm models can be analyzed.Comment: In Proceedings PACO 2011, arXiv:1108.145

A Process Algebra for Supervisory Coordination

A supervisory controller controls and coordinates the behavior of different components of a complex machine by observing their discrete behaviour. Supervisory control theory studies automated synthesis of controller models, known as supervisors, based on formal models of the machine components and a formalization of the requirements. Subsequently, code generation can be used to implement this supervisor in software, on a PLC, or embedded microprocessor. In this article, we take a closer look at the control loop that couples the supervisory controller and the machine. We model both event-based and state-based observations using process algebra and bisimulation-based semantics. The main application area of supervisory control that we consider is coordination, referred to as supervisory coordination, and we give an academic and an industrial example, discussing the process-theoretic concepts employed.Comment: In Proceedings PACO 2011, arXiv:1108.145

p16INK4a hypermethylation and p53, p16 and MDM2 protein expression in Esophageal Squamous Cell Carcinoma

<p>Abstract</p> <p>Background</p> <p>Tumor suppressor genes <it>p53 </it>and <it>p16</it>^INK4aand the proto-oncogene <it>MDM2 </it>are considered to be essential G1 cell cycle regulatory genes whose loss of function is associated with ESCC carcinogenesis. We assessed the aberrant methylation of the <it>p16 </it>gene and its impact on <it>p16</it>^{<it>INK4a </it>}protein expression and correlations with <it>p53 </it>and <it>MDM2 </it>protein expressions in patients with ESCC in the Golestan province of northeastern Iran in which ESCC has the highest incidence of cancer, well above the world average.</p> <p>Methods</p> <p>Cancerous tissues and the adjacent normal tissue obtained from 50 ESCC patients were assessed with Methylation-Specific-PCR to examine the methylation status of <it>p16</it>. The expression of <it>p16</it>, <it>p53 </it>and <it>MDM2 </it>proteins was detected by immunohistochemical staining.</p> <p>Results</p> <p>Abnormal expression of <it>p16 </it>and <it>p53</it>, but not <it>MDM2</it>, was significantly higher in the tumoral tissue. <it>p53 </it>was concomitantly accumulated in ESCC tumor along with <it>MDM2 </it>overexpression and <it>p16 </it>negative expression. Aberrant methylation of the <it>p16</it>^{<it>INK4a </it>}gene was detected in 31/50 (62%) of esophageal tumor samples, while two of the adjacent normal mucosa were methylated (P < 0.001). <it>p16</it>^{<it>INK4a </it>}aberrant methylation was significantly associated with decreased <it>p16 </it>protein expression (P = 0.033), as well as the overexpression of <it>p53 </it>(P = 0.020).</p> <p>Conclusions</p> <p><it>p16 </it>hypermethylation is the principal mechanism of <it>p16 </it>protein underexpression and plays an important role in ESCC development. It is associated with p53 protein overexpression and may influence the accumulation of abnormally expressed proteins in <it>p53-MDM2 </it>and <it>p16-Rb </it>pathways, suggesting a possible cross-talk of the involved pathways in ESCC development.</p

Soluble Fas might serve as a diagnostic tool for gastric adenocarcinoma

<p>Abstract</p> <p>Background</p> <p>Fas (Apo-1/CD95) and its specific ligand (FasL) are key elements in apoptosis. They have been studied in different malignancies but there are few published studies about the soluble forms of these markers (i.e. sFas/sFasL) in gastric cancer. We have compared the serum levels of sFas/sFasL in gastric adenocarcinoma patients and cases with pre-neoplastic lesions as potential markers for early diagnosis, and investigated their relation with clinicopathological characteristics.</p> <p>Methods</p> <p>Fifty-nine newly-diagnosed cases of gastric adenocarcinoma who had undergone gastrectomy, along with 62 endoscopically- and histologically-confirmed non-cancer individuals were enrolled in this study. sFas/sFasL serum levels were detected by Enzyme Linked Immunosurbent Assay.</p> <p>Results</p> <p>Mean serum sFas level was significantly higher in gastric cancer patients than in control group (305.97 ± 63.71 (pg/ml) vs. 92.98 ± 4.95 (pg/ml), P < 0.001); while the mean serum level of sFasL was lower in patients with gastric adenocarcinoma (0.138 ± 0.04 (pg/ml) vs. 0.150 ± 0.02 (pg/ml), P < 0.001). Mean serum levels of sFas/sFasL were significantly different in both intestinal/diffuse and cardiac/non-cardiac subtypes when compared to the control group (P < 0.001). There was an increase in the serum level of sFas from the first steps of pre-neoplastic lesions to gastric adenocarcinoma (P < 0.001). Patients who had no lymph node involvement (<it>N₀</it>) showed significantly higher serum levels of sFas compared to others (P = 0.044).</p> <p>Conclusions</p> <p>Production of sFas may play a critical role in the carcinogenesis of intestinal-type gastric cancer. sFas serum level may serve as a non-invasive tool for early diagnosis of gastric cancer.</p