Polynomial-Time Algorithms for Energy Games with Special Weight Structures

Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help.     

Synthesizing robust systems

Systems should not only be correct but also robust in the sense that they behave reasonably in unexpected situations. This article addresses synthesis of robust reactive systems from temporal specifications. Existing methods allow arbitrary behavior if assumptions in the specification are violated. To overcome this, we define two robustness notions, combine them, and show how to enforce them in synthesis. The first notion applies to safety properties: If safety assumptions are violated temporarily, we require that the system recovers to normal operation with as few errors as possible. The second notion requires that, if liveness assumptions are violated, as many guarantees as possible should be fulfilled nevertheless. We present a synthesis procedure achieving this for the important class of GR(1) specifications, and establish complexity bounds. We also present an implementation of a special case of robustness, and show experimental results.     

Uncertain supply chain network design considering carbon footprint and social factors using two-stage approach

Sustainable development has become one of the leading global issues over the period of time. Currently, implementation of sustainability in supply chain has been continuously in center of attention due to introducing stringent legislations regarding environmental pollution by various governments and increasing stakeholders’ concerns toward social injustice. Unfortunately, literature is still scarce on studies considering all three dimensions (economical, environmental and social) of sustainability for the supply chain. An effective supply chain network design (SCND) is very important to implement sustainability in supply chain. This study proposes an uncertain SCND model that minimizes the total supply chain-oriented cost and determines the opening of plants, warehouses and flow of materials across the supply chain network by considering various carbon emissions and social factors. In this study, a new AHP and fuzzy TOPSIS-based methodology is proposed to transform qualitative social factors into quantitative social index, which is subsequently used in chance-constrained SCND model with an aim at reducing negative social impact. Further, the carbon emission of supply chain is estimated by considering a composite emission that consists of raw material, production, transportation and handling emissions. In the model, a carbon emission cap is imposed on total supply chain to reduce the carbon footprint of supply chain. To solve the proposed model, a code is developed in AMPL software using a nonlinear solver SNOPT. The applicability of the proposed model is illustrated with a numerical example. The sensitivity analysis examines the effects of reducing carbon footprint cap, negative social impacts and varying probability on the total cost of the supply chain. It is observed that a stricter carbon cap over supply chain network leads to opening of more plants across the supply chain. In addition, carbon footprint of supply chain is found to be decreased in certain extent with the reduction in negative social impacts from suppliers. The carbon footprint of the supply chain is found to be reduced with increasing certainty of material supply from the suppliers. The total supply chain cost is observed to be augmented with increasing probability.     

A survey of stochastic ω-regular games

We summarize classical and recent results about two-player games played on graphs with ω-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications.     

2002 Annual Index

Authors Index

2002 Annual Index     

Testing and Diagnosis of Realistic Defects in Digital Microfluidic Biochips

Microfluidics-based biochips are soon expected to revolutionize biosensing, clinical diagnostics and drug discovery. Robust off-line and on-line test techniques are required to ensure system dependability as these biochips are deployed for safety-critical applications. Due to the underlying mixed-technology and mixed-energy domains, biochips exhibit unique failure mechanisms and defects. We first relate some realistic defects to fault models and observable errors. We next set up an experiment to evaluate the manifestations of electrode-short faults. Motivated by the experimental results, we present a testing and diagnosis methodology to detect catastrophic faults and locate faulty regions. The proposed method is evaluated using a biochip performing real-life multiplexed bioassays.     

Strategy logic

We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL¹, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula).     

Current trends in nano‐technological interventions on plant growth and development: a review

Nanomaterials, recently have found burgeoning attention in the field of agriculture, owing to the positive correlation between nanoparticle (NP) application and the enhanced nutritional status of the applied plants. A wide range of NPs, namely carbon‐based NPs, titanium dioxide NPs, silica NPs etc. has been found to influence plants in a positive way by increasing their nutrient uptake ratio, nutrient usage efficiency, among others. All these attributes have paved the way for possible improvement in plant growth, development, vigour etc. through the use of these NPs, mainly as nanofertiliser. In view of all these, it can also be concluded that in the global scenario of increased demand of food production and supply in the coming years, nanotechnology promises to play a critical role. In this review, an attempt has been made to consolidate all the positive trends with respect to application of NPs on plants, along with their probable mechanism of action, which may provide a comprehensive insight for researchers working in this field.Inspec keywords: reviews, nanoparticles, agriculture, nanotechnology, titanium compounds, crops, nanofabrication, fertilisers, food products, nanobiotechnologyOther keywords: nanotechnological interventions, plant growth, positive correlation, nanoparticle application, enhanced nutritional status, applied plants, carbon‐based NPs, titanium dioxide NPs, silica NPs, influence plants, nutrient uptake ratio, nutrient usage efficiency, positive trends     

Balance testing and balance-testable design of logic circuits

We propose a low-cost method for testing logic circuits, termed balance testing, which is particularly suited to built-in self testing. Conceptually related to ones counting and syndrome testing, it detects faults by checking the difference between the number of ones and the number of zeros in the test response sequence. A key advantage of balance testing is that the testability of various fault types can be easily analyzed. We present a novel analysis technique which leads to necessary and sufficient conditions for the balance testability of the standard single stuck-line (SSL) faults. This analysis can be easily extended to multiple stuck-line and bridging faults. Balance testing also forms the basis for design for balance testability (DFBT), a systematic DFT technique that achieves full coverage of SSL faults. It places the unit under test in a low-cost framework circuit that guarantees complete balance testability. Unlike most existing DFT techniques, DFBT requires only one additional control input and no redesign of the underlying circuit is necessary. We present experimental results on applying balance testing to the ISCAS 85 benchmark circuits, which show that very high fault coverage is obtained for large circuits even with reduced deterministic test sets. This coverage can always be made 100% either by adding tests or applying DFBT.This research was supported by the National Science Foundation under Grant No. MIP-9200526. Parts of this paper were published in preliminary form in Proc. 23rd Symp. Fault-Tolerant Computing, Toulouse, June 1993, and in Proc. 31st Design Automation Conf, San Diego, June 1994.     

A Branching Time Temporal Framework for Quantitative Reasoning

Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. Wepresent experimental results on the WQCTL verifier.