Deriving Bisimulation Congruences: 2-categories vs precategories

G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner’s approach to deriving labelled bisimulation congruences from reduction systems. This paper develops the theory of GRPOs further, arguing that they provide a simple and powerful basis towards a comprehensive solution. As an example, we construct GRPOs in a category of ‘bunches and wirings.’ We then examine the approach based on Milner’s precategories and Leifer’s functorial reactive systems, and show that it can be recast in a much simpler way into the 2-categorical theory of GRPOs

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]

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

Community Willingness to Participate in a Dengue Study in Aceh Province, Indonesia

Background: Dengue virus infection is the most rapidly spreading vector-borne disease in the world. Essential research on dengue virus transmission and its prevention requires community participation. Therefore, it is crucial to understand the factors that are associated with the willingness of communities in high prevalence areas to participate in dengue research. The aim of this study was to explore factors associated with the willingness of healthy community members in Aceh province, Indonesia, to participate in dengue research that would require phlebotomy. Methodology/Principal Findings: A community-based cross-sectional study was carried out in nine regencies and municipalities of Aceh from November 2014 to March 2015. Interviews using a set of validated questionnaires were conducted to collect data on demography, history of dengue infection, socioeconomic status, and knowledge, attitude and practice regarding dengue fever. Two-step logistic regression and Spearman's rank correlation (rs) analysis were used to assess the influence of independent variables on dependent variables. Among 535 participants, less than 20% had a good willingness to participate in the dengue study. The factors associated with good willingness to participate were being female, working as a civil servant, private employee or entrepreneur, having a high socioeconomic status and good knowledge, attitude and practice regarding dengue. Good knowledge and attitude regarding dengue were positive independent predictors of willingness to participate (OR: 2.30 [95% CI: 1.36-3.90] and 3.73 [95% CI: 2.24-6.21], respectively). Conclusion/Significance: The willingness to participate in dengue research is very low among community members in Aceh, and the two most important associated factors are knowledge and attitude regarding dengue. To increase participation rate, efforts to improve the knowledge and attitude of community members regarding dengue fever and dengue-related research is required before such studies are launched

An action based framework for verifying logical and behavioural properties of concurrent systems

A system is described which supports proofs of both behavioural and logical properties of concurrent systems; these are specified by means of a process algebra and its associated logics. The logic is an action based version of the branching time logic CTL which we call ACTL; it is interpreted over transition labelled structures while CTL is interpreted over state labelled ones. The core of the system are two existing tools, AUTO and EMC. The first builds the labelled transition system corresponding to a term of a process algebra and permits proof of equivalence and simplification of terms, while the second checks validity of CTL logical formulae. The integration is realized by means of two translation functions from the action based branching time logic ACTL to CTL and from transition-labelled to state-labelled structures. The correctness of the integration is guaranteed by the proof that the two functions when coupled preserve satisfiability of logical formulae

Architectural League Prize for Young Architects and Designers

Recorded June 29, 2010 (35 mins.