Simulation of a low voltage customer microgrid using petri nets

With renewable energy coming to the forefront of how power is generated and delivered to the modern consumer, Microgrids are emerging as an optimal and efficient method for implementing renewables and changing the infrastructure of the dated transmission and distribution grid. This thesis work presents mathematical models of Petri Nets for the simulation of a low voltage customer Microgrid. Using previous work created in this specific field, a Hybrid Petri Net is modified such that it consists of multiple distributed generators, storage, and the utility which is referred to as the main distribution grid in this thesis. A Discrete Petri Net is developed for load shedding which is critical for simulation purposes. Two types of Scheduling are developed, heuristic and reliability ones for the Microgrid to operate. Equations for firing rates are obtained for continuous transitions. Input weather data is obtained from outside sources and modified for the simulation. Computer programs are created for the microgrid simulation and the creation and presentation of the reachability graphs. A total of twelve simulations are run with the data analyzed and reachability graphs for the hybrid and discrete load shedding Petri nets developed for two simulations

Task sequence planning in a robot workcell using AND/OR nets

An approach to task sequence planning for a generalized robotic manufacturing or material handling workcell is described. Given the descriptions of the objects in this system and all feasible geometric relationships among these objects, an AND/OR net which describes the relationships of all feasible geometric states and associated feasibility criteria for net transitions is generated. This AND/OR net is mapped into a Petri net which incorporates all feasible sequences of operations. The resulting Petri net is shown to be bounded and have guaranteed properties of liveness, safeness, and reversibility. Sequences are found from the reachability tree of the Petri net. Feasibility criteria for net transitions may be used to generate an extended Petri net representation of lower level command sequences. The resulting Petri net representation may be used for on-line scheduling and control of the system of feasible sequences. A simulation example of the sequences is described

An efficient algorithm for the parallel solution of high-dimensional differential equations

The study of high-dimensional differential equations is challenging and difficult due to the analytical and computational intractability. Here, we improve the speed of waveform relaxation (WR), a method to simulate high-dimensional differential-algebraic equations. This new method termed adaptive waveform relaxation (AWR) is tested on a communication network example. Further we propose different heuristics for computing graph partitions tailored to adaptive waveform relaxation. We find that AWR coupled with appropriate graph partitioning methods provides a speedup by a factor between 3 and 16

Platform Dependent Verification: On Engineering Verification Tools for 21st Century

The paper overviews recent developments in platform-dependent explicit-state LTL model checking.Comment: In Proceedings PDMC 2011, arXiv:1111.006

Formal analysis techniques for gossiping protocols

We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner. We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them

Importance Sketching of Influence Dynamics in Billion-scale Networks

The blooming availability of traces for social, biological, and communication networks opens up unprecedented opportunities in analyzing diffusion processes in networks. However, the sheer sizes of the nowadays networks raise serious challenges in computational efficiency and scalability. In this paper, we propose a new hyper-graph sketching framework for inflence dynamics in networks. The central of our sketching framework, called SKIS, is an efficient importance sampling algorithm that returns only non-singular reverse cascades in the network. Comparing to previously developed sketches like RIS and SKIM, our sketch significantly enhances estimation quality while substantially reducing processing time and memory-footprint. Further, we present general strategies of using SKIS to enhance existing algorithms for influence estimation and influence maximization which are motivated by practical applications like viral marketing. Using SKIS, we design high-quality influence oracle for seed sets with average estimation error up to 10x times smaller than those using RIS and 6x times smaller than SKIM. In addition, our influence maximization using SKIS substantially improves the quality of solutions for greedy algorithms. It achieves up to 10x times speed-up and 4x memory reduction for the fastest RIS-based DSSA algorithm, while maintaining the same theoretical guarantees.Comment: 12 pages, to appear in ICDM 2017 as a regular pape

Modeling of quad-station module cluster tools using petri nets

The semiconductor industry is highly competitive, and with the recent chip shortage, the throughput of wafers has become more important than ever. One of the tools that the industry has deployed is to use of quad-station modules instead of the traditional single-station modules that allow for higher throughput and better wafer consistency by processing multiple wafers at the same time and distributing work. The industry trend is to use multiple transfer chamber robots to stack the quad-station modules in a series, particularly for etch products. In this work, the quad-station cluster tool wafer movement is modeled by using Petri net as a process-bounded system. The system analysis and simulations are performed by using timed and colored Petri nets. The results are useful to deepen our understanding of the discrete-event dynamics of quad-station module cluster tools and offer the highly needed insight into their efficient and deadlock-free operation

Analysing Coloured Petri Nets by the Occurrence Graph Method

This paper provides an overview og the work done for the author's PhD thesis. The research area of Coloured Petri Nets is introduced, and the available analysis methods are presented. The occurrence graph method, which is the main subject of this thesis, is described in more detail. Summaries of the six papers which, together with this overview, comprise the thesis are given, and the contributions are discussed.A large portion of this overview is dedicated to a description of related work. The aim is twofold: First, to survey pertinent results within the research areas of -- in increasing generality -- Coloured Petri Nets, High-level Petri Nets, and formalisms for modelling and analysis of parallel and distributed systems. Second, to put the results obtained in this thesis in a wider perspective by comparing them with important related work

Incremental Integer Linear Programming Models for Petri Nets Reachability Problems

http://www.intechopen.com/books/petri_net_theory_and_application