1,701 research outputs found
Modeling and Analysis of Power-Aware Systems
The paper describes a formal approach for designing and reasoning about power-constrained, timed systems. The framework is based on process algebra, a formalism that has been developed to describe and analyze communicating concurrent systems. The proposed extension allows the modeling of probabilistic resource failures, priorities of resource usages, and power consumption by resources within the same formalism. Thus, it is possible to model alternative power-consumption behaviors and analyze tradeoffs in their timing and other characteristics. This paper describes the modeling and analysis techniques, and illustrates them with examples, including a dynamic voltage-scaling algorithm
Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation
The notion of quiescence - the absence of outputs - is vital in both
behavioural modelling and testing theory. Although the need for quiescence was
already recognised in the 90s, it has only been treated as a second-class
citizen thus far. This paper moves quiescence into the foreground and
introduces the notion of quiescent transition systems (QTSs): an extension of
regular input-output transition systems (IOTSs) in which quiescence is
represented explicitly, via quiescent transitions. Four carefully crafted rules
on the use of quiescent transitions ensure that our QTSs naturally capture
quiescent behaviour.
We present the building blocks for a comprehensive theory on QTSs supporting
parallel composition, action hiding and determinisation. In particular, we
prove that these operations preserve all the aforementioned rules.
Additionally, we provide a way to transform existing IOTSs into QTSs, allowing
even IOTSs as input that already contain some quiescent transitions. As an
important application, we show how our QTS framework simplifies the fundamental
model-based testing theory formalised around ioco.Comment: In Proceedings MBT 2012, arXiv:1202.582
Using schedulers to test probabilistic distributed systems
This is the author's accepted manuscript. The final publication is available at Springer via http://dx.doi.org/10.1007/s00165-012-0244-5. Copyright Ā© 2012, British Computer Society.Formal methods are one of the most important approaches to increasing the confidence in the correctness of software systems. A formal specification can be used as an oracle in testing since one can determine whether an observed behaviour is allowed by the specification. This is an important feature of formal testing: behaviours of the system observed in testing are compared with the specification and ideally this comparison is automated. In this paper we study a formal testing framework to deal with systems that interact with their environment at physically distributed interfaces, called ports, and where choices between different possibilities are probabilistically quantified. Building on previous work, we introduce two families of schedulers to resolve nondeterministic choices among different actions of the system. The first type of schedulers, which we call global schedulers, resolves nondeterministic choices by representing the environment as a single global scheduler. The second type, which we call localised schedulers, models the environment as a set of schedulers with there being one scheduler for each port. We formally define the application of schedulers to systems and provide and study different implementation relations in this setting
A balanced formula of essential amino acids promotes brain mitochondrial biogenesis and protects neurons from ischemic insult
Mitochondrial dysfunction plays a key role in the aging process, and aging is a strong risk factor for neurodegenerative diseases or brain injury characterized by impairment of mitochondrial function. Among these, ischemic stroke is one of the leading causes of death and permanent disability worldwide. Pharmacological approaches for its prevention and therapy are limited. Although non-pharmacological interventions such as physical exercise, which promotes brain mitochondrial biogenesis, have been shown to exert preventive effects against ischemic stroke, regular feasibility is complex in older people, and nutraceutical strategies could be valuable alternatives. We show here that dietary supplementation with a balanced essential amino acid mixture (BCAAem) increased mitochondrial biogenesis and the endogenous antioxidant response in the hippocampus of middle-aged mice to an extent comparable to those elicited by treadmill exercise training, suggesting BCAAem as an effective exercise mimetic on brain mitochondrial health and disease prevention. In vitro BCAAem treatment directly exerted mitochondrial biogenic effects and induced antioxidant enzyme expression in primary mouse cortical neurons. Further, exposure to BCAAem protected cortical neurons from the ischemic damage induced by an in vitro model of cerebral ischemia (oxygen-glucose deprivation, OGD). BCAAem-mediated protection against OGD was abolished in the presence of rapamycin, Torin-1, or L-NAME, indicating the requirement of both mTOR and eNOS signaling pathways in the BCAAem effects. We propose BCAAem supplementation as an alternative to physical exercise to prevent brain mitochondrial derangements leading to neurodegeneration and as a nutraceutical intervention aiding recovery after cerebral ischemia in conjunction with conventional drugs
Testing Reactive Probabilistic Processes
We define a testing equivalence in the spirit of De Nicola and Hennessy for
reactive probabilistic processes, i.e. for processes where the internal
nondeterminism is due to random behaviour. We characterize the testing
equivalence in terms of ready-traces. From the characterization it follows that
the equivalence is insensitive to the exact moment in time in which an internal
probabilistic choice occurs, which is inherent from the original testing
equivalence of De Nicola and Hennessy. We also show decidability of the testing
equivalence for finite systems for which the complete model may not be known
Transumbilical laparoscopic treatment of Congenital Infantile Fibrosarcoma of the Ileum.
Congenital-Infantile Fibrosarcoma (CIF) is a malignant mesenchymal tumor representing 10-20% of soft-tissue tumors. Complete surgical resection is generally the treatment of choice. The most recurrent cytogenetic abnormality was identified as the traslocation t(12;15)(p13:q25), which bears the fusion of Tel gene EVT6 with TrkC gene. This study describes a case of infantile fibrosarcoma of the ileum in a female newborn examined for intestinal occlusion and its laparoscopic treatment
Ambient Air Pollution, Social Inequalities and Asthma Exacerbation in Greater Strasbourg (France) Metropolitan Area: the PAISA Study
International audienceThe socio-economic status (SES) of populations has an influence on the incidence or mortality rates of numerous health outcomes, among which respiratory diseases (Prescott et al., 2003; Ellison-Loschmann et al., 2007). Considering asthma, the possible contribution of SES to overall prevalence āregardless of asthma severity-, remains controversial in industrialized countries. Several studies indicate that allergic asthma is more prevalent in more well-off populations whereas the non-allergic forms of asthma are more common in the deprived ones (Cesaroni et al., 2003; Blanc et al., 2006). On the other hand, severe asthma whatever its etiology appears to be more frequent in the latter populations, as compared to the more affluent (Basagana et al., 2004). Risk factors for exacerbations (e.g., passive smoking (Wright Subramanian, 2007), psychosocial stress (Gold & Wright, 2005), cockroach allergens (Kitch et al., 2000), and suboptimal compliance with anti-inflammatory medication (Gottlieb et al., 1995)) are generally more common among people with asthma and low SES than their better-off counterparts. These observations support the hypothesis that some factors more present in deprived populations contribute to asthma exacerbation (Mielck et al., 1996)
An Algorithm for Probabilistic Alternating Simulation
In probabilistic game structures, probabilistic alternating simulation
(PA-simulation) relations preserve formulas defined in probabilistic
alternating-time temporal logic with respect to the behaviour of a subset of
players. We propose a partition based algorithm for computing the largest
PA-simulation, which is to our knowledge the first such algorithm that works in
polynomial time, by extending the generalised coarsest partition problem (GCPP)
in a game-based setting with mixed strategies. The algorithm has higher
complexities than those in the literature for non-probabilistic simulation and
probabilistic simulation without mixed actions, but slightly improves the
existing result for computing probabilistic simulation with respect to mixed
actions.Comment: We've fixed a problem in the SOFSEM'12 conference versio
Probabilistic Mobility Models for Mobile and Wireless Networks
International audienceIn this paper we present a probabilistic broadcast calculus for mobile and wireless networks whose connections are unreliable. In our calculus, broadcasted messages can be lost with a certain probability, and due to mobility the connection probabilities may change. If a network broadcasts a message from a location, it will evolve to a network distribution depending on whether nodes at other locations receive the message or not. Mobility of nodes is not arbitrary but guarded by a probabilistic mobility function (PMF), and we also define the notion of a weak bisimulation given a PMF. It is possible to have weak bisimular networks which have different probabilistic connectivity information. We furthermore examine the relation between our weak bisimulation and a minor variant of PCTL* [1]. Finally, we apply our calculus on a small example called the Zeroconf protocol [2]
- ā¦