We present algorithms for checking and enforcing robustness of concurrent programs against the Total Store Ordering (TSO) memory model. A program is robust if all its TSO computations correspond to computations under the Sequential Consistency (SC) semantics. We provide a complete characterization of non-robustness in terms of so-called attacks: a restricted form of (harmful) out-of-program-ord...

We present algorithms for checking and enforcing robustness of concurrent programs against the Total Store Ordering (TSO) memory model. A program is robust if all its TSO computations correspond to computations under the Sequential Consistency (SC) semantics. We provide a complete characterization of non-robustness in terms of so-called attacks: a restricted form of (harmful) out-of-program-ord...

Decisions about infrastructure projects or new policies in the transport sector have traditionally been based on cost benefit analysis (CBA). However, as society in general becomes more and more complex, this affects the decisionmaking process. Thus decision-makers are confronted with the difficult problem of evaluating potential outcomes and choosing policies to achieve the desired outcomes in...

in this paper, stability analysis of walking gaits and robustness analysis are developed for a five-link and four-actuator biped robot. stability conditions are derived by studying unactuated dynamics and using the poincarã© map associated with periodic walking gaits. a stable gait is designed by an optimization process satisfying physical constraints and stability conditions. also, considering...

This paper investigates original local update schemes for Cellular Automata (CA) in structural design. Local problems based on mathematical programming and optimality criteria are tested, allowing the isolation of an original local update scheme. The scheme consists of repeating analysis and optimality-based design rules locally. Several systematic experiments on various problem sizes are perfo...

In railway simulation, given timetables have to be checked against various criteria, mainly correctness and robustness. Most existing approaches use classical centralized simulation techniques. This work goes beyond that in two main aspects: We use constraint satisfaction to get rid of dead lock problems and the simulation is done distributed for better performance. This should make it possible...

We design a feedback control architecture for longitudinal flight of an aircraft. The multi-level architecture includes the flight control loop to govern the short term dynamics of the aircraft, and the autopilot to control the long term modes. Using H∞ performance and robustness criteria, the problem is cast as a non-convex and non-smooth optimization program. We present a non-convex bundle me...

This paper models and analyzes task allocation methodologies for multiagent systems. The evaluation process was implemented as a collection of simulated soccer matches. A soccer-simulation software package was used as the test-bed as it provided the necessary features for implementing and testing the methodologies. The methodologies were tested through competitions with a number of available so...

The efficiency and robustness of reliability methods are two important factors in the first-order reliability method (FORM). The conjugate choice control (CCC) and directional chaos control method (DCC) are developed to improve the robustness and efficiency of the FORM formula using the stability transformation method. In this paper, the CCC and DCC methods are applied for the reliability analy...

Dynamic simulations are necessary for understanding the mechanism of how biochemical networks generate robust properties to environmental stresses or genetic changes. Sensitivity analysis allows the linking of robustness to network structure. However, it yields only local properties regarding a particular choice of plausible parameter values, because it is hard to know the exact parameter value...