Start-up delay Estimation at Signalized Intersections: Impact of Left-Turn Phasing Sequences

This paper aims to investigate the start-up delay at signalized intersections in Abu Dhabi (AD) city, UAE. Impact of external factors that may affect the start-up delay is examined including left turn phasing sequences (split/lead/lag), movement turning (through/left), intersection location (CBD/non-CBD) and day time (peak/off-peak). A new technique of data collection was applied based on the automate records of license plate of vehicles and a comparison with the traditional video recorded technique was carried out. Data covered 66 approaches of 36 signalized intersections. The analysis showed that overall estimated mean value of the start-up delay is 2.201 sec. with a standard deviation of 1.823 sec. The t-test shows significant statistical difference in start-up delay between observations at through and left movements, at CDB and non-CDB area and at split and lead/lag phasing. However, no significant differences were found between peak and off-peak periods and between split and lead phasing. In general, lead/lag phasing sequences not only improved the overall delay at signalized intersection but also improved the start-up delay.nbsp nbs

Forward Analysis and Model Checking for Trace Bounded WSTS

We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all $\omega$-regular properties on the set of infinite traces of the system

The Parametric Ordinal-Recursive Complexity of Post Embedding Problems

Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) and prove parametric lower bounds depending on the size of the alphabet.Comment: 16 + vii page

Algorithmic Verification of Asynchronous Programs

Asynchronous programming is a ubiquitous systems programming idiom to manage concurrent interactions with the environment. In this style, instead of waiting for time-consuming operations to complete, the programmer makes a non-blocking call to the operation and posts a callback task to a task buffer that is executed later when the time-consuming operation completes. A co-operative scheduler mediates the interaction by picking and executing callback tasks from the task buffer to completion (and these callbacks can post further callbacks to be executed later). Writing correct asynchronous programs is hard because the use of callbacks, while efficient, obscures program control flow. We provide a formal model underlying asynchronous programs and study verification problems for this model. We show that the safety verification problem for finite-data asynchronous programs is expspace-complete. We show that liveness verification for finite-data asynchronous programs is decidable and polynomial-time equivalent to Petri Net reachability. Decidability is not obvious, since even if the data is finite-state, asynchronous programs constitute infinite-state transition systems: both the program stack and the task buffer of pending asynchronous calls can be potentially unbounded. Our main technical construction is a polynomial-time semantics-preserving reduction from asynchronous programs to Petri Nets and conversely. The reduction allows the use of algorithmic techniques on Petri Nets to the verification of asynchronous programs. We also study several extensions to the basic models of asynchronous programs that are inspired by additional capabilities provided by implementations of asynchronous libraries, and classify the decidability and undecidability of verification questions on these extensions.Comment: 46 pages, 9 figure

Health Worker Factors Associated with Prescribing of Artemisinin Combination Therapy for Uncomplicated Malaria in Rural Tanzania.

Improving malaria case management is partially dependent on health worker compliance with clinical guidelines. This study assessed health worker factors associated with correct anti-malarial prescribing practices at two sites in rural Tanzania. Repeated cross-sectional health facility surveys were conducted during high and low malaria transmission seasons in 2010 and collected information on patient consultations and health worker characteristics. Using logistic regression, the study assessed health worker factors associated with correct prescription for uncomplicated malaria defined as prescription of artemisinin-based combination therapy (ACT) for patients with fever and Plasmodium falciparum asexual infection based on blood slide or malaria rapid diagnostic test (RDT) according to national treatment guidelines. The analysis included 685 patients with uncomplicated malaria who were seen in a health facility with ACT in stock, and 71 health workers practicing in 30 health facilities. Overall, 58% of malaria patients were correctly treated with ACT. Health workers with three or more years' work experience were significantly more likely than others to prescribe correctly (adjusted odds ratio (aOR) 2.9; 95% confidence interval (CI) 1.2-7.1; p = 0.019). Clinical officers (aOR 2.2; 95% CI 1.1-4.5; p = 0.037), and nurse aide or lower cadre (aOR 3.1; 95% CI 1.3-7.1; p = 0.009) were more likely to correctly prescribe ACT than medical officers. Training on ACT use, supervision visits, and availability of job aids were not significantly associated with correct prescription. Years of working experience and health worker cadre were associated with correct ACT prescription for uncomplicated malaria. Targeted interventions to improve health worker performance are needed to improve overall malaria case management

Preventing childhood malaria in Africa by protecting adults from mosquitoes with insecticide-treated nets

Malaria prevention in Africa merits particular attention as the world strives toward a better life for the poorest. Insecticide-treated nets (ITNs) represent a practical means to prevent malaria in Africa, so scaling up coverage to at least 80% of young children and pregnant women by 2010 is integral to the Millennium Development Goals (MDG). Targeting individual protection to vulnerable groups is an accepted priority, but community-level impacts of broader population coverage are largely ignored even though they may be just as important. We therefore estimated coverage thresholds for entire populations at which individual- and community-level protection are equivalent, representing rational targets for ITN coverage beyond vulnerable groups

Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom

We consider the problem of verifying deadlock freedom for symmetric cache coherence protocols. In particular, we focus on a specific form of deadlock which is useful for the cache coherence protocol domain and consistent with the internal definition of deadlock in the Murphi model checker: we refer to this deadlock as a system- wide deadlock (s-deadlock). In s-deadlock, the entire system gets blocked and is unable to make any transition. Cache coherence protocols consist of N symmetric cache agents, where N is an unbounded parameter; thus the verification of s-deadlock freedom is naturally a parameterized verification problem. Parametrized verification techniques work by using sound abstractions to reduce the unbounded model to a bounded model. Efficient abstractions which work well for industrial scale protocols typically bound the model by replacing the state of most of the agents by an abstract environment, while keeping just one or two agents as is. However, leveraging such efficient abstractions becomes a challenge for s-deadlock: a violation of s-deadlock is a state in which the transitions of all of the unbounded number of agents cannot occur and so a simple abstraction like the one above will not preserve this violation. In this work we address this challenge by presenting a technique which leverages high-level information about the protocols, in the form of message sequence dia- grams referred to as flows, for constructing invariants that are collectively stronger than s-deadlock. Efficient abstractions can be constructed to verify these invariants. We successfully verify the German and Flash protocols using our technique

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