Non-enumerative Generation of Path Delay Distributions and its Application to Critical Path Selection

A Monte Carlo based approach is proposed capable of identifying in a non-enumerative and scalable manner the distributions that describe the delay of every path in a combinational circuit. Furthermore, a scalable approach to select critical paths from a potentially exponential number of path candidates is presented. Paths and their delay distributions are stored in Zero Suppressed Binary Decision Diagrams. Experimental results on some of the largest ISCAS-89 and ITC-99 benchmarks shows that the proposed method is highly scalable and effective

High-level Counterexamples for Probabilistic Automata

Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic systems so far computed either a large set of system runs or a subset of the system's states, both of which are of limited use in manual debugging. Many probabilistic systems are described in a guarded command language like the one used by the popular model checker PRISM. In this paper we describe how a smallest possible subset of the commands can be identified which together make the system erroneous. We additionally show how the selected commands can be further simplified to obtain a well-understandable counterexample

Job-shop scheduling with approximate methods

Imperial Users onl

Structure and topology of transcriptional regulatory networks and their applications in bio-inspired networking

Biological networks carry out vital functions necessary for sustenance despite environmental adversities. Transcriptional Regulatory Network (TRN) is one such biological network that is formed due to the interaction between proteins, called Transcription Factors (TFs), and segments of DNA, called genes. TRNs are known to exhibit functional robustness in the face of perturbation or mutation: a property that is proven to be a result of its underlying network topology. In this thesis, we first propose a three-tier topological characterization of TRN to analyze the interplay between the significant graph-theoretic properties of TRNs such as scale-free out-degree distribution, low graph density, small world property and the abundance of subgraphs called motifs. Specifically, we pinpoint the role of a certain three-node motif, called Feed Forward Loop (FFL) motif in topological robustness as well as information spread in TRNs. With the understanding of the TRN topology, we explore its potential use in design of fault-tolerant communication topologies. To this end, we first propose an edge rewiring mechanism that remedies the vulnerability of TRNs to the failure of well-connected nodes, called hubs, while preserving its other significant graph-theoretic properties. We apply the rewired TRN topologies in the design of wireless sensor networks that are less vulnerable to targeted node failure. Similarly, we apply the TRN topology to address the issues of robustness and energy-efficiency in the following networking paradigms: robust yet energy-efficient delay tolerant network for post disaster scenarios, energy-efficient data-collection framework for smart city applications and a data transfer framework deployed over a fog computing platform for collaborative sensing --Abstract, page iii

A Cross-level Verification Methodology for Digital IPs Augmented with Embedded Timing Monitors

Smart systems are characterized by the integration in a single device of multi-domain subsystems of different technological domains, namely, analog, digital, discrete and power devices, MEMS, and power sources. Such challenges, emerging from the heterogeneous nature of the whole system, combined with the traditional challenges of digital design, directly impact on performance and on propagation delay of digital components. This article proposes a design approach to enhance the RTL model of a given digital component for the integration in smart systems with the automatic insertion of delay sensors, which can detect and correct timing failures. The article then proposes a methodology to verify such added features at system level. The augmented model is abstracted to SystemC TLM, which is automatically injected with mutants (i.e., code mutations) to emulate delays and timing failures. The resulting TLM model is finally simulated to identify timing failures and to verify the correctness of the inserted delay monitors. Experimental results demonstrate the applicability of the proposed design and verification methodology, thanks to an efficient sensor-aware abstraction methodology, by applying the flow to three complex case studies

An integer programming based algorithm for the resource constrained project scheduling problem

Ankara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 2005.Thesis (Master's) -- Bilkent University, 2005.Includes bibliographical references leaves 48-54.In this thesis, we study the problem of scheduling the activities of a single project in order for all resource and precedence relationships constraints to be satisfied with an objective of minimizing the project completion time. To solve this problem, we propose an Integer Programming based approximation algorithm, which has two phases. In the first phase of the algorithm, a subproblem generation technique and enumerative cuts used to tighten the formulation of the problem are presented. If an optimal solution is not found within a predetermined time limit, we continue with the second phase that uses the cuts and the lower bound obtained in the first phase. In order to evaluate the efficiency of our algorithm, we used the benchmark instances in the literature and compared the results with the best known solutions available for these instances. Finally, the computational results are reported and discussed.Büyüktahtakın, İsmet EsraM.S

Multi-objective routing and scheduling for airport ground movement

Recent research on airport ground movement introduced an Active Routing framework to support multi-objective trajectory-based operations. This results in edges in the airport taxiway graph having multiple costs such as taxi time, fuel consumption and emissions. In such a graph, multiple edges exist between two nodes reflecting different trade-offs among the multiple costs. Aircraft will have to choose the most efficient edge from multiple edges in order to traverse from one node to another respecting various operational constraints. In this paper, we introduce a multi-objective routing and scheduling algorithm based on the enumerative approach that can be used to solve such a multi-objective multi-graph problem. Results using the proposed algorithm for a range of international airports are presented. Compared with other routing and scheduling algorithms, the proposed algorithm can find a representative set of optimal or near optimal solutions in a single run when the sequence of aircraft is fixed. In order to accelerate the search, heuristic functions and a preference-based approach are introduced. We analyse the performance of different approaches and discuss how the structure of the multi-graph affects computational complexity and quality of solutions

Cyber-Based Contingency Analysis and Insurance Implications of Power Grid

Cybersecurity for power communication infrastructure is a serious subject that has been discussed for a decade since the first North American Electric Reliability Corporation (NERC) critical infrastructure protection (CIP) initiative in 2006. Its credibility on plausibility has been evidenced by attack events in the recent past. Although this is a very high impact, rare probability event, the establishment of quantitative measures would help asset owners in making a series of investment decisions. First, this dissertation tackles attackers\u27 strategies based on the current communication architecture between remote IP-based (unmanned) power substations and energy control centers. Hypothetically, the identification of intrusion paths will lead to the worst-case scenarios that the attackers could do harm to the grid, e.g., how this switching attack may perturb to future cascading outages within a control area when an IP-based substation is compromised. Systematic approaches are proposed in this dissertation on how to systematically determine pivotal substations and how investment can be prioritized to maintain and appropriate a reasonable investment in protecting their existing cyberinfrastructure. More specifically, the second essay of this dissertation focuses on digital protecting relaying, which could have similar detrimental effects on the overall grid\u27s stability. The R-k contingency analyses are proposed to verify with steady-state and dynamic simulations to ensure consistencies of simulation outcome in the proposed modeling in a power system. This is under the assumption that attackers are able to enumerate all electronic devices and computers within a compromised substation network. The essay also assists stakeholders (the defenders) in planning out exhaustively to identify the critical digital relays to be deployed in substations. The systematic methods are the combinatorial evaluation to incorporate the simulated statistics in the proposed metrics that are used based on the physics and simulation studies using existing power system tools. Finally, a risk transfer mechanism of cyber insurance against disruptive switching attacks is studied comprehensively based on the aforementioned two attackers\u27 tactics. The evaluation hypothetically assesses the occurrence of anomalies and how these footprints of attackers can lead to a potential cascading blackout as well as to restore the power back to normal stage. The research proposes a framework of cyber insurance premium calculation based on the ruin probability theory, by modeling potential electronic intrusion and its direct impacts. This preliminary actuarial model can further improve the security of the protective parameters of the critical infrastructure via incentivizing investment in security technologies