To see the other types of publications on this topic, follow the link: Timed Petri Net.
Dissertations / Theses on the topic 'Timed Petri Net'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Timed Petri Net.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
OKUMA, Shigeru, Tatsuya SUZUKI, Fumiharu FUJIWARA, and Akio INABA. "Timed Petri Net Based Scheduling for Mechanical Assembly : Integration of Planning and Scheduling." Institute of Electronics, Information and Communication Engineers, 1998. http://hdl.handle.net/2237/14986.
Full text
2
Hagman, Mikael. "Instrumentation of timed automata for formal verification of timed properties." Thesis, Linköping University, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-9861.
Full textAbstract:
<p>Embedded systems are used in many technical products of today. The tendency also points to the fact that they are in many ways becoming more and more complex as technology advances. Systems like advanced avionics, air bags, ABS brakes or any real-time embedded system requires reliability, correctness and timeliness. This puts hard pressure on designers, analyzers and developers. The need for high performance and non failing systems has therefore led to a growing interest in modeling and verification of component-based embedded systems in order to reduce costs and simplify design and development. The solution proposed by the Embedded Systems Lab at Linköping University is the modeling language PRES+, Petri Net based Representation for Embedded Systems.</p><p>PRES+ models are then translated into timed automata, TA, which is used by the UPPAAL verification tool. To be able to verify timing properties the translated TA model must be instrumented with certain timers, called clocks. These clocks must be reset in a manner reflected by the property to be verified.</p><p>This thesis will provide a solution to the problem and also give the reader necessary information in order to understand the theoretical background needed. The thesis will also show the reader the importance of modeling and time verification in the development of embedded systems. A simple example is used to describe and visualize the benefit regarding real-time embedded systems as well as the importance of the ability to verify these systems.</p><p>The conclusion drawn stresses the fact that high development costs, possible gain of human lives and the problems in developing complex systems only emphasize the need for easy to handle and intuitive verification methods.</p>
3
OKUMA, Shigeru, Tatsuya SUZUKI, Akio INABA, and YoungWoo KIM. "Scheduling for a Large-Scale Production System Based on a Continuous and Timed Petri-Net Model." Institute of Electronics, Information and Communication Engineers, 2003. http://hdl.handle.net/2237/14984.
Full text
4
He, Zhou. "Performance optimization of a class of deterministic timed Petri nets : weighted marked graphs." Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0166/document.
Full textAbstract:
Au cours des dernières décennies, la complexité croissante des systèmes de production et de leur commande a rendu crucial le besoin d’utiliser les méthodes formelles pour faire face aux problèmes relatifs au contrôle, à la fiabilité, au diagnostic des fautes et à l’utilisation optimale des ressources dans les installations de production. Cela concerne en particulier les systèmes automatisés de production (SAP), caractérisés par des cycles technologiques complexes qui doivent s’adapter à des conditions changeantes. Les SAP modernes sont des sous-systèmes interconnectés tels que des machines à commande numérique, des stations d'assemblage , des véhicules guidés automatisés (AGV), des cellules robotisées, des convoyeurs et des systèmes de contrôle par ordinateur. Les fabricants utilisent des machines automatisées et des contrôleurs pour assurer des produits de qualité plus rapidement et plus efficacement. Aussi, ces systèmes automatisés peuvent fournir des informations essentielles pour aider les gestionnaires à prendre les bonnes décisions. Cependant, en raison de la grande flexibilité des SAP, des défaillances telles qu’un mauvais assemblage ou le dépôt d’une pièce dans un tampon inapproprié peuvent se produire lors du fonctionnement du système. De tels dysfonctionnements diminuent la productivité du système générant ainsi des pertes économiques et des effets perturbateurs sur le système. En conséquence, le problème de l’optimisation des performances des SAP est impératif.Cette thèse se focalise sur l’évaluation et l’optimisation des performances des systèmes de production automatisés via le modèle des réseaux de Pétri temporisés<br>In the last decades, there has been a constant increase in the awareness of company management about the importance of formal techniques in industrial settings to address problems related to monitoring and reliability, fault diagnosis, and optimal use of resources, during the management of plants. Of particular relevance in this setting are the so-called Automated Manufacturing Systems (AMSs), which are characterized by complex technological cycles that must adapt to changing demands. Modern AMSs are interconnected subsystems such as numerically controlled machines, assembly stations, automated guided vehicles, robots, conveyors and computer control systems. Manufacturers are using automated machines and controls to produce quality products faster and more efficiently. Meanwhile, these automated systems can provide critical information to help managers make good business decisions. However, due to the high flexibility of AMSs, failures such as a wrong assembly or a part put in a wrong buffer may happen during the operation of the system. Such failures may decrease the productivity of the system which has an economical consequence and can cause a series of disturbing issues. As a result, the performance optimization in AMSs are imperative. This thesis focuses on the performance evaluation and performance optimization of automated manufacturing systems using timed Petri nets models
5
Baruwa, Olatunde Temitope. "A timed state space-heuristic search framework for colored petri net-based scheduling of discrete event systems —an application to flexible manufacturing systems." Doctoral thesis, Universitat Autònoma de Barcelona, 2015. http://hdl.handle.net/10803/310425.
Full textAbstract:
Para obtener una ventaja competitiva en el mercado global, los fabricantes tienen que adaptarse rápidamente sus sistemas para responder a las fluctuantes demandas de los clientes en virtud de factores de servicio de alta calidad. La alta inversión de capital en los sistemas de fabricación flexible (SFFs), junto con los desafíos de las condiciones de mercado que cambian rápidamente se ha convertido en esencial la utilización eficiente de los recursos. Para maximizar los beneficios de un SFF, se necesita una implantación de técnicas de programación e planificación adecuadas para aprovechar plenamente las flexibilidades de fabricación. El objetivo global de esta tesis es establecer un marco de programación basado en el modelado de redes de Petri coloreadas temporales (RdPCT) para optimizar el rendimiento de los SFF mediante el desarrollo de herramientas y métodos de búsqueda eficientes basados en el análisis del espacio de estados (EdE). El análisis del espacio del estado es una herramienta potente que se puede utilizar para automatizar la actividad de toma de decisiones en problemas de programación mediante el seguimiento de todos los posibles comportamientos del sistema modelado. Sin embargo, adolece del problema de explosión de espacio de estado debido a la complejidad computacional de los problemas de programación de la producción en SFFs. Lo que ha limitado su aplicabilidad a problemas de tamaño pequeño.
En la metodología de la programación propuesta, la generación de un plan de producción óptimo consiste en la construcción y el recorrido del espacio de estados con un algoritmo de búsqueda. Además, se requiere un simulador para la ejecución del modelo de RdPCT. Es muy natural utilizar el gráfico algoritmos de búsqueda ya que el método de análisis subyacente se basa en el EdE. La estrategia de búsqueda gráfica es una técnica interdisciplinaria que atraviesa los campos de la inteligencia artificial (IA), la investigación operativa (OR), e Informática. Esta tesis se centra en los métodos de búsqueda heurística basados en IA que se utilizan para simular solamente los mejores escenarios (como un problema de búsqueda del camino más corto). En este método, la exploración de los EdE son guiados con funciones heurísticas que se basan en el conocimiento de los planes de producción.
La contribución de esta tesis es cuádruple. La primera ofrece la plataforma en que se implementan las otras tres contribuciones: una herramienta para soporte de decisión automatizada y de uso especial llamado TIMed State space Performance Analysis Tool (TIMSPAT). En segundo lugar, se desarrolló un enfoque de memoria eficiente para aliviar el problema de escalabilidad que aparece en la exploración de EdE de problemas de programación FMS. En tercer lugar, se presenta dos algoritmos de búsqueda heurística a cualquier hora, desarrollados para superar las desventajas de los algoritmos de búsqueda heurística convencionales. Finalmente, la última contribución presenta un enfoque basado en RdPCT a la programación simultánea de máquinas y vehículos guiados automáticamente (AGV) con enrutamiento libre de conflictos.<br>To gain competitive advantage in the global market, manufacturers have to quickly adapt their systems to respond to fluctuating customer demands under high-quality service factors. The high capital investment in flexible manufacturing systems (FMSs) together with the challenges of the rapidly changing market conditions has made efficient resource utilization become essential. To maximize the benefits of an FMS, appropriate scheduling techniques must be put in place to fully exploit the manufacturing flexibilities. The overall objective of this thesis is to establish a scheduling framework based on timed colored Petri net (TCPN) modeling for optimizing the performance of FMSs through the development of tools and efficient search methods based on the reachability graph (or state space) analysis.
In the proposed TCPN-based scheduling methodology, the generation of an optimal production schedule involves the construction and traversal of the state space with a search algorithm. Also, a simulator is required for executing the TCPN model. It is quite natural to use graph search algorithms since the underlying analysis method relies on the reachability graph. Graph search strategy is an interdisciplinary technique that spans across the fields of Artificial intelligence (AI), Operations research (OR), and Computer science. This thesis focuses on AI-based heuristic search methods used in simulating only the best scenarios (as a shortest-path search problem). In this method, the exploration of reachability graphs are guided with heuristic functions that rely on the knowledge of the production plans.
The contribution of this thesis is fourfold. The first provides the platform called TIMSPAT in which the other three contributions are implemented. Because of the complex data structure, TCPN-based scheduling using reachability graph analysis has been merely looked at in the literature. Thanks to the common data structure of the heuristic search methods, TIMSPAT is capable of incorporating different search algorithms in a single executable tool. So far, nine algorithms have been implemented, which includes the search algorithms proposed in this thesis and those by other authors.
Second, a memory-efficient approach is developed to alleviate the scalability problem that appears in the state space exploration of FMS scheduling problems. The approach tackles the research questions: Is it necessary to store all the generated states to guarantee an optimal solution without revisiting states? and how can one reduce the number of states to be stored so that larger problems can be solved without forgoing optimality? It assumes that the state space graphs of a system with increasing problem size may contain repetitive patterns while the underlying model structure remains as constant as possible. The proposed solution is based on the notion that the structural behavior captured in the state space of a solvable smaller problem size can be extended to explore a larger size if the two problems share a certain kind of similarity.
The third contribution presents two anytime heuristic search algorithms developed to overcome the drawbacks of conventional heuristic search algorithms. The first anytime algorithm adapts and improves an existing anytime algorithm to TCPN-based scheduling, while the second proposes a new algorithm that combines two heuristic search algorithms making them anytime for deadlock-free scheduling. The algorithms are suitable for both off-line and on-line scheduling purposes due to their effectiveness in adapting to different CPU constraints.
The last contribution presents a TCPN-based approach to the simultaneous scheduling of machines and automated guided vehicles (AGVs) with conflict-free routing. Unlike the existing approaches that employ a decomposition framework, the entire scheduling problem is described in a single model. Two simultaneous scheduling models are proposed and evaluated using an event-driven vehicle assignment solution as opposed to the traditional dispatching rules.
6
Parrot, Rémi. "Réseaux de Petri temporisés pour la synthèse de circuits pipelinés." Thesis, Ecole centrale de Nantes, 2022. http://www.theses.fr/2022ECDN0048.
Full textAbstract:
Dans cette thèse, nous nous intéressons à l’optimisation des ressources consommées par un circuit implémentant une loi de commande pour la charge de véhicules électriques sur FPGA. Tout d’abord, nous proposons une nouvelle solution au problème de la synthèse de pipeline minimisant les bascules et garantissant une fréquence minimale de fonctionnement. En se basant sur cette même approche, nous sommes capable de construire un pipeline permettant le pliage (ou multiplexage temporel) du circuit, c’est-à-dire qui permet la fusion de portions du circuit identiques en séquençant leur accès. Ainsi, les ressources consommées sont réduites à la fois en nombre de bascule et en nombre d’unités logiques. Notre approche est basée sur un modèle de Réseau de Petri Temporisé avec des transitions retardables, pouvant rater leur date de tir, et une action spécifique appelée reset qui réinitialise les horloges de toutes les transitions. Ce modèle s’avère équivalent à un automate à une horloge. Une surclasse de ce modèle, les Réseaux de Petri Temporisés avec transitions retardables (sans reset), s’avère être incomparable, en terme d’expressivité en sémantique faible, avec les classes de Réseaux de Petri Temporels ou Temporisés en temps dense ou discret. Enfin, une exploration symbolique de ce modèle ainsi que des résultats de complexité théorique et pratique sont étudiés<br>In this thesis, we are interested in the optimization of the resources consumed by a circuit implementing a control law for the charging of electric vehicles on FPGA. First, we propose a new solution to the pipeline synthesis problem that minimizes the number of flip-flops and guarantees a minimum operating frequency. Based on this same approach, we are able to build a pipeline that allows the folding (or time multiplexing) of the circuit, i.e., that allows the merging of identical circuit portions by sequencing their access. Thus, the consumed resources are reduced both in number of flip-flops and in number of logical units. Our approach is based on a Timed Petri Net model with delayable transitions that can miss their firing date, and a specific action called reset that resets the clocks of all transitions. This model is shown to be equivalent to a one-clock automaton. An overclass of this model, the Timed Petri Nets with delayable transitions (without reset), turns out tobe incomparable, in terms of expressivity in weak semantics, with the classes of Temporal or Timed Petri nets in dense or discrete time. Finally, a symbolic exploration of this model and results on theoretical and practical complexity are studied
7
Benfekir, Abderrahim. "Contribution à l'analyse de performances des Systèmes à Evénements Discrets non linéaires dans l'algèbre (min,+)." Phd thesis, Université de Cergy Pontoise, 2013. http://tel.archives-ouvertes.fr/tel-00957875.
Full textAbstract:
Cette thèse s'inscrit dans le cadre de la théorie des systèmes linéaires dans les dioïdes. Cette théorie concerne la sous-classe des systèmes à événements discrets modélisables par les Graphes d'Événements Temporisés (GET). La dynamique de ces graphes peut être représentée par des équations récurrentes linéaires sur des structures algébriques particulières telles que l'algèbre (max,+) ou l'algèbre (min,+).Ce mémoire est consacré à l'analyse de performances des systèmes dynamiques qui peuvent être modélisés graphiquement par des Graphes d'Événements Temporisés Généralisés (GETG). Ces derniers, contrairement au GET, n'admettent pas une représentation linéaire dans l'algèbre (min,+). Pour pallier à ce problème de non linéarité, nous avons utilisé une approche de modélisation définie sur un dioïde d'opérateurs muni de deux lois internes : loi additive correspondant à l'opération (min), et loi multiplicative équivalente à la loi de composition usuelle. Le modèle d'état obtenu, est utilisé pour évaluer les performances des GETG. Pour cela, nous avons proposé une nouvelle méthode qui a pour but de linéariser le modèle mathématique régissant l'évolution dynamique du modèle graphique, dans le but d'obtenir un modèle (min,+) linéaire. La deuxième partie de cette thèse est consacrée au problème qui consiste à déterminer les ressources à utiliser dans une ligne de production, en vue d'atteindre des performances souhaitée. Ceci est équivalent à déterminer le marquage initial de la partie commande du GETG.
8
Cherif, Ghassen. "Ordonnancement dans les ateliers hybrides en environnement incertain." Thesis, Normandie, 2021. http://www.theses.fr/2021NORMLH04.
Full textAbstract:
Cette thèse concerne les problèmes d'ordonnancement pour une classe de systèmes manufacturiers flexibles (FMS) en environnement incertain. Les systèmes considérés répondent aux exigences de l’industrie 4.0 qui requièrent des organisations plus agiles permettant de proposer des produits personnalisés. Plus précisément, les systèmes proposés dans ce travail sont appelés FMS hybrides et traitent les opérations avec des contraintes de précédence partielles entre les opérations. La première contribution est une approche systématique de modélisation des FMS hybrides avec les réseaux de Petri temporisés sur les transitions (T-TPN) et un formalisme multi-niveaux basé sur la structuration hiérarchique des opérations. La deuxième contribution concerne la recherche d’ordonnancements pour les FMS hybrides. Nous utilisons la recherche en faisceau et proposons une fonction coût basée sur la modélisation multiniveaux. Nous proposons également une nouvelle variante de la recherche en faisceau, appelée Generation Filtered Beam Search (GFBS). Cette nouvelle variante améliore la qualité des candidats sélectionnés par rapport à d’autres variantes par un meilleur équilibre entre la largeur et la profondeur de la recherche. La troisième contribution concerne l’étude des aléas pouvant affecter le système. Un risque d’interruption, dû à l’occurrence d'événements incontrôlables, est intégré, et une nouvelle fonction coût qui intègre ce risque est définie. Enfin, un algorithme de recherche en faisceau modifié, appelé Generation Double Filtered Beam Search (GDFBS), qui accélère la convergence de la méthode, est proposé. Ce nouvel algorithme est basé sur un mécanisme de filtrage qui utilise la fonction coût pour explorer de manière sélective l'espace d'état du T-TPN afin de trouver une séquence de contrôle qui réalise un compromis entre performance et risque<br>This thesis concerns the scheduling problems for a class of flexible manufacturing systems (FMS) in uncertain environment. The considered systems meet the requirements of Industry 4.0, which require more flexibility and modularity to offer personalized products. More precisely, the proposed systems in this work are called hybrid FMS and deal with operations with partial precedence constraints. The first contribution is a systematic approach used for the modeling of hybrid FMS with timed Petri nets (T-TPN) and a multi-level formalism based on the hierarchical organization of operations. The second contribution concerns the scheduling of hybrid FMS. We use the beam search and propose a cost function based on the multi-level modeling. We also offer a new variant of beam search called Generation Filtered Beam Search (GFBS). This new variant improves the quality of the selected candidates compared to other variants of beam search by a better balance between the width and the depth of the search. The third contribution concerns the study of interruptions that can affect the system. A risk of interruption, due to the occurrence of uncontrollable events, is integrated, and a new cost function that incorporates this risk is defined. Finally, a modified beam search algorithm, called Generation Double Filtered Beam Search (GDFBS), which accelerates the convergence of the method, is proposed. The new algorithm is based on a filtering mechanism that uses the cost function to selectively explore the state space of the TPN in order to find a control sequence that achieves a tradeoff between performance and risk
9
Masapati, Gulammahammad Hasanasaheb. "Performance prediction using timed Petri nets." Thesis, University of Ottawa (Canada), 1987. http://hdl.handle.net/10393/5155.
Full text
10
Rogge-Solti, Andreas, Laura Vana, and Jan Mendling. "Time Series Petri Net Models - Enrichment and Prediction." CEUR Workshop Proceedings, 2015. http://epub.wu.ac.at/5394/1/paper8.pdf.
Full textAbstract:
Operational support as an area of process mining aims to predict the
temporal performance of individual cases and the overall business process. Although
seasonal effects, delays and performance trends are well-known to exist
for business processes, there is up until now no prediction model available that
explicitly captures this. In this paper, we introduce time series Petri net models.
These models integrate the control flow perspective of Petri nets with time series
prediction. Our evaluation on the basis of our prototypical implementation demonstrates
the merits of this model in terms of better accuracy in the presence of time
series effects.
11
Tanabe, Makoto. "Timed Petri Nets and Temporal Linear Logic." 京都大学 (Kyoto University), 1999. http://hdl.handle.net/2433/181934.
Full text
12
Wiley, Richard Paul. "Performance analysis of Stochastic Timed Petri Nets." Thesis, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/15002.
Full textAbstract:
Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986.<br>MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING<br>Bibliography: leaves 305-310.<br>by Richard Paul Wiley.<br>Sc.D.
13
Cui, Qing Ming. "Parallel and distributed simulation of timed Petri nets." Thesis, University of Exeter, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245946.
Full text
14
Rada, Irina. "Distributed generation of state space for timed Petri nets." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0018/MQ54952.pdf.
Full text
15
Santini, Marie. "Analysis of asynchronous iterative algorithms using timed Petri nets." Thesis, University of Salford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360405.
Full text
16
Hillion, H. P. (Herve P. ). "Performance evaluation of decisionmaking organizations using Timed Petri Nets." Thesis, Massachusetts Institute of Technology, 1986. http://hdl.handle.net/1721.1/15071.
Full textAbstract:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1986.<br>MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING<br>Bibliography: leaves 155-156.<br>by Herve P. Hillion.<br>M.S.
17
Bowden, Fred D. J. "The modelling and analysis of command and control decision processes using extended time petri nets." Title page, table of contents and abstract only, 2001. http://web4.library.adelaide.edu.au/theses/09PH/09phb784.pdf.
Full textAbstract:
Bibliography: leaves 177-191. This thesis uses a new type of extended time Petri net to model and analyse command and control decision processes. A comprehensive review of existing time Petri net structures is given. This concludes with the introduction of time Petri net structure that incorporates the most commonly used time structures. This extended time Petri net structure is then used in the definition of the basic modelling blocks required to model command and control decision processes. This basic modelling block forms the basis of the direct analysis techniques that are introduced in the thesis.
18
Cortés, Luis Alejandro. "A Petri Net based Modeling and Verification Technique for Real-Time Embedded Systems." Licentiate thesis, Linköping University, Linköping University, ESLAB - Embedded Systems Laboratory, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5751.
Full textAbstract:
<p>Embedded systems are used in a wide spectrum of applications ranging from home appliances and mobile devices to medical equipment and vehicle controllers. They are typically characterized by their real-time behavior and many of them must fulfill strict requirements on reliability and correctness.</p><p>In this thesis, we concentrate on aspects related to modeling and formal verification of realtime embedded systems.</p><p>First, we define a formal model of computation for real-time embedded systems based on Petri nets. Our model can capture important features of such systems and allows their representations at different levels of granularity. Our modeling formalism has a welldefined semantics so that it supports a precise representation of the system, the use of formal methods to verify its correctness, and the automation of different tasks along the design process.</p><p>Second, we propose an approach to the problem of formal verification of real-time embedded systems represented in our modeling formalism. We make use of model checking to prove whether certain properties, expressed as temporal logic formulas, hold with respect to the system model. We introduce a systematic procedure to translate our model into timed automata so that it is possible to use available model checking ools. Various examples, including a realistic industrial case, demonstrate the feasibility of our approach on practical applications.</p>
19
Xia, Fei. "Supporting the MASCOT method with Petri net techniques for real-time systems development." Thesis, King's College London (University of London), 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325515.
Full text
20
Salimifard, Khodakaram. "Modelling and performance evaluation of workflows using timed hierarchical Petri nets." Thesis, Lancaster University, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.418850.
Full text
21
Shen, Yuanyuan. "Exploiting timed coloured Petri nets in control and analysis of Graphplan." Thesis, Liverpool John Moores University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.431272.
Full text
22
Jiffry, Mustafa Abdulrahman. "Petri nets approach for the analysis of MASCOT interprocess communications." Thesis, King's College London (University of London), 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.324637.
Full text
23
Suciu, Floarea. "Performance analysis of timed Petri nets by decomposition of the state space." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0028/MQ34234.pdf.
Full text
24
Tabacchi, Peter J. "Analysis of engineer C2 as modeled by stochastic, timed attributed Petri Nets." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA238339.
Full textAbstract:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 1990.<br>Thesis Advisor(s): Caldwell, William J. ; Read, Robert R. Second Reader: Whitaker, Lyn R. "September 1990." Description based on title screen as viewed on December 21, 2009. DTIC Identifier(s): Command And Control Systems, Timed Petri Nets, Attributed Petri Nets, Land Warfare, Thesis. Author(s) subject terms: Land Warfare, Military Planning, Military Science, Petri Nets, Command and Control, Combat Engineers. Includes bibliographical references (p. 80). Also available in print.
25
TAVARES, Eduardo Antônio Guimarães. "A time Petri net based approach for software synthesis in Hard Real-Time embedded systems with multiple processors." Universidade Federal de Pernambuco, 2006. https://repositorio.ufpe.br/handle/123456789/2589.
Full textAbstract:
Made available in DSpace on 2014-06-12T15:59:31Z (GMT). No. of bitstreams: 2
arquivo5135_1.pdf: 1049051 bytes, checksum: e5be25e2aa87cb17b0788411f129a4a8 (MD5)
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2006<br>Atualmente, sistemas embarcados são ubíquos. Em outras palavras, eles estão em todos os lugares. Desde utilitários domésticos (ex: fornos microondas, refrigeradores, videocassetes, máquinas de fax, máquinas de lavar roupa, alarmes) até equipamentos militares (ex: mísseis guiados, satélites espiões, sondas espaciais, aeronaves), nós podemos encontrar um sistema embarcado. Desnecessário afirmar que a vida humana tem se tornado mais e mais dependente desses sistemas. Alguns sistemas embarcados são classificados como sistemas de tempo real, onde o comportamento correto depende não somente da integridade dos resultados, mas também nos tempos em que tais resultados são produzidos. Em sistemas embarcados de tempo real críticos, se as restrições temporais não forem satisfeitas, as conseqüências podem ser desastrosas, incluindo grandes danos aos equipamentos ou mesmo perdas de vidas humanas. Devido a tarefas que possuem alta taxa de utilização de processador, alguns sistemas embarcados (ex: dispositivos médicos) precisam ser compostos de mais de um processador para obter performance aceitável e, no caso de sistemas embarcados de tempo real críticos, para satisfazer as restrições temporais críticas. Entretanto, questões adicionais precisam ser consideradas para lidar com um ambiente multiprocessado, tal como comunicação entre processadores e sincronização. Nessa dissertação, um método de síntese de software baseado no formalismo matemático redes de Petri com tempo é apresentado para lidar com sistemas embarcardos de tempo real críticos com múltiplos processadores. A abordagem inicia a partir de uma especificação (usualmente composta de tarefas concorrentes e comunicantes) e automaticamente gera o código fonte de um programa considerando: (i) as funcionalidades e restrições; e (ii) o suporte operacional para execução das tarefas em um ambiente multiprocessado. Síntese de software é uma alternativa para sistemas operacionais especializados para dar suporte a execução de um programa. Sistemas operacionais são usualmente genéricos e podem introduzir atrasos no tempo de execução, e ao mesmo tempo produzir alto consumo de memória. Por outro lado, a síntese de software é uma alternativa de projeto, dado que este método automaticamente gera o código fonte do programa, satisfazendo a funcionalidade, as restrições especificadas, o suporte para execução, e a minimização dos atrasos e uso de memória
26
Thumu, Prashanth. "TIME CONDITION SYSTEMS." UKnowledge, 2005. http://uknowledge.uky.edu/gradschool_theses/374.
Full textAbstract:
The current thesis considers the issue of state estimation of condition systems, a form of petri net with signal inputs and outputs. In previous research the problem of unobservability due to progress confusion was identified, in the presence of which state estimation is not possible. Here we introduce the notion of Time Condition Systems", a class of condition systems that uses timing information from condition models to overcome state estimation problem caused by progress confusion. To make use of the timing information in the plant model, a procedure called Exploded Time Plant" is synthesized. This procedure makes the plant model an observable model. It is proved that this procedure does not alter the structural and temporal behavior of the plant model and the plant maintains its integrity. The time plant(s) and the corresponding Exploded time plant(s) are subsequently used to develop observer(s) and controller(s) for Time condition models.
27
Cavalcante, Sergio Vanderlei. "A hardware-software co-design system for embedded real-time applications." Thesis, University of Newcastle Upon Tyne, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360339.
Full text
28
Kriščiūnas, Darius. "Gyvenamojo namo šildymo ir vėdinimo sistemos kompiuterinio valdymo modelio sudarymas ir tyrimas naudojant Petri tinklą." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2005. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050522_223544-30240.
Full textAbstract:
Presently information systems are increasingly penetrating to our daily life. Recently it is relevant to integrate the newest technologies. In that way traditional system becomes “smart” who are more economical, optimal, and self-sufficient. The biggest problem is to make a model of “smart” system. There were analyzed modeling methods, heating and cooling control systems in this job. Mathematical model for heating and cooling controller using timed Petri nets was presented. According to analyzed problems it was made verification with Matlab during experimental phase. There was made comparison evaluation of mathematical model made with timed Petri nets and fuzzy logic.
29
Aghanoori, Navid. "Real-time Power Management of Renewable Microgrid based on IEC 61850 Communication Protocol Using Adaptive Intelligent Petri Net." Thesis, Curtin University, 2020. http://hdl.handle.net/20.500.11937/79919.
Full textAbstract:
My personal interest and practical experience in renewable industry encouraged me to study my PhD in relation to the cascaded interaction of the microgrid power management, the stability of microgrid and the communication delays within microgrid’s control system. This PhD proposes a real-time power management platform equipped with an adaptive intelligent Petri Net and a new data class of IEC 61850 standard to optimise the cost of microgrid operation while maintaining its stability.
30
Krull, Claudia. "Discrete time Markov chains advanced applications in simulation." Erlangen San Diego, Calif. SCS, 2008. http://d-nb.info/992577586/04.
Full text
31
Meyer, Anna-Lena [Verfasser], Michael [Akademischer Betreuer] Dellnitz, and Manuel L. [Akademischer Betreuer] Silva. "Symmetries and bifurcations in timed continuous Petri nets / Anna-Lena Meyer. Betreuer: Michael Dellnitz ; Manuel L. Silva." Paderborn : Universitätsbibliothek, 2012. http://d-nb.info/1036891364/34.
Full text
32
Baldellon, Olivier. "Supervision en ligne de propriétés temporelles dans les systèmes distribués temps-réel." Phd thesis, Toulouse, INPT, 2014. http://oatao.univ-toulouse.fr/13299/1/baldellon.pdf.
Full textAbstract:
Les systèmes actuels deviennent chaque jour de plus en plus complexe; à la distribution s’ajoutent les contraintes temps réel. Les méthodes classiques en charge de garantir la sûreté de fonctionnement, comme le test, l’injection de fautes ou les méthodes formelles ne sont plus suffisantes à elles seules. Afin de pouvoir traiter les éventuelles erreurs lors de leur apparition dans un système distribué donné, nous désirons mettre en place un programme, surveillant ce système, capable de lancer une alerte lorsque ce dernier s’éloigne de ses spécifications ; un tel programme est appelé superviseur (ou moniteur). Le fonctionnement d’un superviseur consiste simplement à interpréter un ensemble d’informations provenant du système sous forme de message, que l’on qualifiera d’évènement, et d’en déduire un diagnostic. L’objectif de cette thèse est de mettre un place un superviseur distribué permettant de vérifier en temps réel des propriétés temporelles. En particulier nous souhaitons que notre moniteur soit capable de vérifier un maximum de propriétés avec un minimum d’information. Ainsi notre outil est spécialement conçu pour fonctionner parfaitement même si l’observation est imparfaite, c’est-à-dire, même si certains évènements arrivent en retard ou s’ils ne sont jamais reçus. Nous avons de plus cherché à atteindre cet objectif de manière distribuée pour des raisons évidentes de performance et de tolérance aux fautes. Nous avons ainsi proposé un protocole distribuable fondé sur l’exécution répartie d’un réseau de Petri temporisé. Pour vérifier la faisabilité et l’efficacité de notre approche, nous avons mis en place une implémentation appelée Minotor qui s’est révélée avoir de très bonnes performances. Enfin, pour montrer l’expressivité du formalisme utilisé pour exprimer les spécifications que l’on désire vérifier, nous avons détaillé un ensemble de propriétés sous forme de réseaux de Petri à double sémantique introduite dans cette thèse (l’ensemble des transitions étant partitionné en deux catégories de transitions, chacune de ces parties ayant sa propre sémantique).
33
Naedele, Martin. "On the modeling and evaluation of real-time systems." [S.l.] : [s.n.], 2000. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=13564.
Full text
34
LIU, Baisi. "An Efficient Approach for Diagnosability and Diagnosis of DES Based on Labeled Petri Nets, Untimed and Timed Contexts." Phd thesis, Ecole Centrale de Lille, 2014. http://tel.archives-ouvertes.fr/tel-01064597.
Full textAbstract:
Cette thèse s'intéresse à l'étude des problèmes de diagnostic des fautes sur les systèmes à événements discrets dans des contextes atemporel et temporel sur la base de modèles réseau de Petri. Des techniques d'exploration incrémentale et à-la-volée sont développées pour combattre le problème de l'explosion de l'espace d'état. Dans le contexte atemporel, une représentation algébrique pour les réseaux de Petri labellisés (RdP-L) a été développée pour caractériser le comportement du système. La diagnosticabilité de modèles RdP-L est ensuite abordée par l'analyse d'une série de problèmes d'analyse de K -diagnosticabilité, où K peut être augmenté progressivement. Concrètement, l'analyse de la diagnosticabilité est effectuée sur la base de deux modèles nommés respectivement FM-graph et FM-set tree qui sont développés à-la-volée et qui contiennent les informations relatives aux fautes. Un diagnostiqueur peut facilement être dérivé à partir du FM-set tree pour le diagnostic en ligne. Dans le contexte temporel, une technique de fractionnement des intervalles de temps a été élaborée pour développer une représentation de l'espace d'état des réseaux de Petri labellisés et temporels (RdP-LT) pour laquelle des techniques d'analyse de la diagnosticabilité du contexte atemporel, peuvent être exploitées. Sur cette base, les conditions nécessaires et suffisantes pour la diagnosticabilité de RdP-LT ont été déterminées, et nous présentons la solution pour le délai minimum qui assure la diagnosticabilité. En pratique, l'analyse de la diagnosticabilité est effectuée sur la base de la construction à-la-volée d'une structure que l'on appelle ASG et qui contient des informations relatives à l'occurrence de fautes sur les états du RdP-LT. D'une manière générale, l'analyse effectuée sur la base des techniques à-la-volée et incrémentale permet de construire et explorer seulement une partie de l'espace d'état. Les résultats des analyses effectuées sur certains benchmarks montrent l'efficacité des techniques que nous avons développées en termes de temps et de mémoire par rapport aux approches traditionnelles basées sur l'énumération des états.
35
Shi, Lihua. "Uniting formal and structured methods for the development of reliable software." Thesis, Manchester Metropolitan University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388141.
Full text
36
Marsal, Gaëlle. "Evaluation of time performances of ethernet-based automation systems by simulation of high-level Petri nets." Cachan, Ecole normale supérieure, 2006. http://tel.archives-ouvertes.fr/tel-00162228.
Full textAbstract:
Nous évaluons dans cette thèse deux performances temporelles des architectures d’automatisation distribuées sur Ethernet commuté et utilisant un modèle de coopération client/serveur : Le temps de réponse entre une occurrence d’un événement d’entrée et l’occurrence de l’événement de sortie correspondant ; Le temps de cycle réeseau pour la scrutation par un contrôleur de l’ensemble de ses modules d’entrées / sorties déportées. La conjonction de trois mécanismes de consommation de temps rend ces deux performances variables et difficiles à déterminer de manière analytique. Par conséquent, la méthode proposée se base sur la simulation d’un modèle en réseau de Petri temporisé et coloré du comportement dynamique de l’architecture complète. Les résultats obtenus sur six architectures test permettent de : Montrer que les architectures multi-contrôleurs utilisant le modèle de coopération client / serveur donnent des temps de cycle réseau plus rapide que celles basées sur les modèles maître / esclave et producteur / consommateur ; Quantifier l’influence du réseau et des mécanismes de consommation du temps<br>In this work, two time performances of switched Ethernet automation systems that use a client/server cooperation model are evaluated : The response time from an occurrence of an input event to the occurrence of the corresponding output event ; The network cycle time for the scanning by a controller of the whole set of its remote inputs / outputs modules. The conjunction of three time consumption mechanisms makes both time performances variable and difficult to compute in an analytic fashion. Thus, the proposed method is based on simulation of a timed and coloured Petri net model of the dynamic behaviour of the whole automation architecture. The results which have been obtained on six benchmark architectures enabled us : To show that multi-controllers architectures using a client/server cooperation model provide faster network cycle times than those based on master/slave and producer/consumer models ; To quantify the influence of the time consumption mechanisms on these performances
37
Clark, Ian George. "A unified approach to the study of asynchronous communication mechanisms in real-time systems." Thesis, King's College London (University of London), 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.326237.
Full text
38
Rau, de Almeida Callou Gustavo. "Energy consumption and execution time estimation of embedded system applications." Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/1877.
Full textAbstract:
Made available in DSpace on 2014-06-12T15:52:55Z (GMT). No. of bitstreams: 1
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2009<br>Nos últimos anos, a redução do consumo de energia das aplicações dos sistemas embarcados
tem recebido uma grande atenção da comunidade científica, visto que, como o
tempo de resposta e o baixo consumo de energia são requisitos conflitantes, esses estudos
tornam-se altamente necessários. Nesse contexto, é proposta uma metodologia aplicada
nas fases iniciais de projeto para dar suporte às decisões relativas ao consumo de energia
e ao desempenho das aplicações desses dispositivos embarcados.
Al´em disso, esse trabalho propõe modelos temporizados de eventos discretos que são
avaliados através de uma metodologia de simulção estocástica com o objetivo de representar
diferentes cenários dos sistemas com facilidade. Dessa forma, para cada cenário ´e
preciso decidir o n´umero máximo de simulações e o tamanho de cada rodada da simulação,
onde ambos os fatores podem impactar no desempenho para se obter tais estimativas.
Essa metodologia considera também, um modelo intermediário que representa a descrição
do comportamento do sistema e, é através desse modelo que cenários são analisados. Esse
modelo intermediário ´e baseado em redes de Petri coloridas temporizadas que permitem
não somente a anáise do software, mas também fornece suporte a um conjunto de métodos
bem estabelecidos para verificações de propriedades.
É
nesse contexto que o software, ALUPAS, responsável por estimar o consumo de
energia e o tempo de execução dos sistemas embarcados é apresentado. Por fim, um
caso de estudo real, assim como tamb´em, exemplos customizados são apresentados com
a finalidade de mostrar a aplicabilidade desse trabalho, onde usuários não especializados
não precisam interagir diretamente com o formalismo de redes de Petri.
39
Mahata, Pritha. "Model Checking Parameterized Timed Systems." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-4835.
Full text
40
Marsal, Gaelle [Verfasser]. "Evaluation of time performances of Ethernet-based Automation Systems by simulation of High-level Petri Nets / Gaelle Marsal." Aachen : Shaker, 2007. http://d-nb.info/1166512339/34.
Full text
41
Wen, Yuan Line, and 溫員林. "Synchronization Models for Interactive Multimedia Presentation Using Timed Petri Net." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/58460028133605852520.
Full textAbstract:
碩士<br>國立海洋大學<br>電機工程學系<br>87<br>In an interactive multimedia presentation system, the user is allowed to manipulate the presentation sequence such as to repeat a sub-sequence, choose a sequence branch, change the playing speed, and reverse the playing sequence through by keyboard, mouse or program.
In this paper, we propose multimedia synchronization models based on timed Petri nets, called Object Slice Petri Nets (OSPN). An OSPN is an extension of an OCPN (Object Composed Petri Nets) proposed by Little, etc. to consider user interactions for handing the presentation sequence. Our proposed methodology concentrates on synchronization at two levels, called the macro and micro levels. Modules are proposed to specify all user interaction scenarios at the micro level. For the part of the presentation where no user interaction is involved, we construct the scenario at the macro level.
Finally, for representing a real-world multimedia scenario, the OSPN may develop a very complex behavior whose qualitative properties are difficult to verify with reasonably computational cost. A systematic synthesis method based on an extension of the knitting technique is used for our scenario synthesis. It is a good approach to synthesize well-behaved nets. In this thesis, deadlock-free dynamic scenario nets are also proposed.
42
Huamg, Jian-Cing, and 黃建欽. "Developping a Remote Control System Based on Timed Petri-Net." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/57557647748432125794.
Full textAbstract:
碩士<br>中華大學<br>科技管理研究所<br>94<br>In recent years, with the development of more precise and complicated control units in the production manufacturing systems, the traditional process control designs via Ladder Logic Diagrams become more difficult and inflexible, and the variances of process are also far harder to deal with. The advanced functions of control programming design and system troubleshooting diagnosis would be expected to develop for effectively reducing the process time and increasing the efficiency of machines. This research proposes Timed Petri-Net to build the Modulus Production System (MPS) real-time dynamic control and a remote monitoring model which can be fell into the following stages: using Visual Basic Programming language to create the real-time dynamic model and developing the remote control system through process control. Furthermore, an ActiveX-based monitoring webpage would be dedicated to data transition and communication.
This study employs the MPS testing device to establish the relevant software and hardware interface and construct a real-time Timed Petri-net model in the Automation and Logistics laboratory of Chung-Hua university. Comparing with the previous remote monitoring system, the presented network expresses the responses of movements or the state through timeliness delay in the Timed Petri-net model in order to prevent MPS from taking place and deadlock. The experimental procedures are as follows: first analyzing the MPS operation process, and then developing the various Petri-net diagrams in terms of MPS machines. Additionally, a real-time dynamic Timed Petri-net model can be generated, in accordance with different machine functions, to adapt the control interfaces and the off-line testing and verifying ways of machines. If the real-time dynamic Timed Petri-net model is proved successful to meet MPS operational process, then exploiting the webpage to build remote monitoring system for implementing the real-time troubleshooting diagnosis.
43
Yeh, Chien-Fa, and 葉建發. "Development of Colored Timed Petri Net Emulator Based on Three-Tier Architecture." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/75473887187290186269.
Full textAbstract:
碩士<br>國立臺灣大學<br>機械工程學系研究所<br>86<br>Virtual factory is supposed to provide a total solution for shortening manuf
acturing cycle time and achieving customer satisfactions. Hence, many world-cl
ass companies dedicate themselves to establish their own virtual factories. Ho
wever, it is difficult to implement a virtual factory because of the lack of a
ssistant tools. A three-tier architecture based colored timed Petri net emula
tor is developed in this thesis to provide such kind of tool. The three-tier a
rchitecture based emulator is easy to maintain and extend. This thesis adopts
UML and Microsoft COM/DCOM techniques to design and implement the emulator, re
spectively. The CTPN emulator is suitable to model the complex systems, especi
ally those with concurrent and asynchronous behaviors. In addition, this emula
tor provides distributed simulation ability. Each CTPN emulator can communicat
e each other to achieve the concurrence among subnets. Finally, we discuss a c
ase of flexible manufacturing system, which is constructed by the proposed emu
lator, and prove the feasibility of the proposed emulator while applying to vi
rtual factories.
44
JHANG, HONG-JIA, and 張洪嘉. "Combination of Petri Net information flow, Timed Petri Net, Stochastic Petri Net and Petri Net Modeling of Buffers for innovative R&D process establishment and production flow analysis (PFA) of LED track light, as well as the related knowledgebase establishment." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/rkvm44.
Full textAbstract:
碩士<br>國立臺灣科技大學<br>機械工程系<br>106<br>The paper applies Petri Net information flow, and combines Timed Petri Net theory, Stochastic Petri Net theory, Petri Net Modeling of Buffers and Petri Net dataflow calculation and integration information transmission concept, calculation data and production of time parameters, innovative development process of design and manufacture of LED track light for estimation of assembling time, and manufacturing process model. The paper designs the modeling of buffers in the production process, attempting to prevent blockade of raw materials and workpieces, and make the entire production process smoother and closer to the real situation. Besides, the paper also adds to the production process with the functions of manufacturing scheduling and computer-aided manufacturing process planning in order to make the manufacturing schedule planned more smoothly, more completely. Faster planning of manufacturing process can reduce the waste of time. And in the production process, there might be a situation that there is equipment needed to be repaired, and the maintenance staff may need a period of time to carry out maintenance of equipment.
Therefore, the time spent on waiting for completion of equipment maintenance has to be added, letting users to understand more thoroughly the relationship between the overall design and the information of manufacturing flow. The paper also applies Petri Net theory and Petri Net dataflow calculation to establish a process flow model with calculation data to be applied to the modified TOPSIS method of the combined modified DANP of LED track light, so as to select a prioritized product function improvement program. The paper also enters and expands the theories relating to Petri Net information flow, the related knowledge required for planning the design and manufacturing processes, the related theoretical design and manufacturing knowledge, the modified TOPSIS of the combined modified DANP, and the related knowledge of patents, to the private cloud of theoretical knowledge relating to innovative development process, and to the knowledgebase of LED track light patents. In this way, the related LED track light knowledge can be increased, letting users learn the knowledge more easily, and allowing them to apply the knowledge to the innovative development process framework models.
45
Huang, Bo-Wei, and 黃柏維. "A Timed Petri Net Approach for Job Shop Scheduling with Setup Time and Routing Flexibility." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/20782766865329297372.
Full textAbstract:
碩士<br>國立雲林科技大學<br>工業工程與管理研究所碩士班<br>101<br>In order to reach the customization, multi-functional machines become more and more. It can execute the different operation by changing tools and modulating the process parameters. As the reason, it raises the routing flexibility in the manufacturing system, and the times about changing tools and modulating parameters call setup times. This paper proposes a method to job shop scheduling problems with anticipatory independent setup times and routing flexibility. First, timed petri nets are used for presenting the behavior of job shop scheduling problems. Then, a mathematical programming model is constructed based on the timed petri nets. An A* algorithm with dynamic weighting heuristic function developed by Bo Huang is modified to find optimal or sub-optimal scheduling solution. The proposed dynamic weighting heuristic function with newly adding minimum operation residual time is developed to solve the scheduling problem. Finally, an example of a job shop scheduling problem is given to verify the proposed algorithm, and the results show that the performance of the proposed algorithm is better than other A* algorithms. In addition, and the A* algorithms with adding the minimum operation residual time have better performances than those without adding the minimum operation residual time.
46
Lee, HsuanJung, and 李宣瑢. "A Study of Tested and Verified Producing Process Based-on Timed Petri Net." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/86147122219041698723.
Full textAbstract:
碩士<br>聖約翰科技大學<br>電機工程系碩士在職專班<br>100<br>Automotive industry under the impact of the economic crisis the parties, facing shrinking sales market, but manufacturers also asked each depot must be a certain degree of price reduction, to manufacturers in the face of multiple pressures, in addition to the cost of raw materials control, there are the to control their manufacturing processes must be streamlined and working hours, human, to enhance production capacity, and thus produce more profits; from the studies of the research data available to confirm that companies can send via the Internet to verify the existing Green production process, According to the research data available from the Token movement, and find conflict and labor-intensive, man hour of delay the workstation, and then address the human cost of cost issues.
47
chen, Yen-chen, and 陳彥臻. "A Coloured Timed Petri Net approach for shortest traveling time and deadlock avoidance of AGV systems." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/18402962001439920872.
Full textAbstract:
碩士<br>國立雲林科技大學<br>工業工程與管理研究所碩士班<br>99<br>The automated guided vehicle (AGV) system is the most flexible material handling system. AGV system design must consider some management issues to avoid resource conflicts and deadlock situations from occuring, and to process material handling in the shortest time to complete the work. When AGV system deadlock occurs, the system may cause paralysis or blockage, and reduce the overall system productivity. In this research, based on the given layout and job requirements of a bidirectional AGV system, we investigated a deadlock-free system and the shortest travel time path. First, the AGV coloured timed petri net (ACTPN) model is established and is used to describe the dynamic behavior of AGVs to analyze the conditions of deadlock and establish the deadlock avoidance policies. Then, according to the deadlock avoidance policies and consider synchronous mode of operation, the Best-First search (BFS) rule is introduced to find the dispatching sequences for AGVs.
48
Shen, Zong-Yi, and 沈宗逸. "Combination of Petri Net information flow, Timed Petri Net and Stochastic Petri Net for innovative R&D process establishment and production flow analysis (PFA) of LED stage light, as well as the related knowledgebase establishment." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/75890556136001591453.
Full textAbstract:
碩士<br>國立臺灣科技大學<br>機械工程系<br>105<br>The paper applies the innovative R&D process design and manufacturing process model of LED stage light, with prediction of production and assembling time that combines Petri Net information flow, Timed Petri Net theory, Stochastic Petri Net and Petri Net dataflow calculated and integrated information transmission concept, calculation data and time parameters. The paper adds the concept of “probability” to production process. Preconceiving the unexpected events that will possibly happen would make the whole production process closer to the real situation. The paper also adds the function of manufacturing lead time process planning to assembling process, avoiding unnecessary waste of cost and time to subsequent manufacturing process. Meanwhile, users can also understand more about the relationship between overall design and manufacturing process framework. The paper applies a process model, which is established by Timed Petri Net theory, Petri Net theory and Petri Net dataflow calculation, and possesses calculation data, time parameters, and calculation of design and assembling lead time, to a product function-based modified Decision-making Trial and Evaluation Laboratory (modified DEMATEL) of LED stage light. Modified DANP method, which combines product functions with the modified Analysis Network Process (modified ANP), is employed to perform selection of a prioritized improvement plan of product function. The paper also uses Petri Net information flow-related theory, the related knowledge required for design and manufacturing process planning, and the modified DANP method with product function, being design and manufacturing-related theoretical knowledge and the related patent knowledge. The above knowledge is entered and expanded to the private cloud of theoretical knowledge relating to innovative R&D process and knowledgebase LED stage light patents. In this way, stage light-related knowledge can be increased for users to learn more easily. The paper also adds the knowledge of material requirement planning, master production scheduling, inventory control and process planning, to the private cloud of theories about innovative R&D process. The paper also adds the Japanese patents to the public cloud of patents, and adds scheduling software to the private cloud of remote commercial software. As a result, they can be applied to innovative R&D process framework model; and the manufacturing and production process framework and mutual dependence relationship can be more complete.
49
Li, Chien-Hao, and 李健豪. "A Colored Timed Object-oriented Petri Net Approach for Modeling and Scheduling of Cluster Tool." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/82949145192534346100.
Full textAbstract:
碩士<br>東海大學<br>工業工程學系<br>91<br>Multi-chamber cluster tool, which consists of multi-chambers loaded and unloaded by different types of robots, are commonly used in semiconductor fabs, the successfulness of its corresponding shop floor scheduling and control system will greatly affect the effectiveness of the fab’s performance. However, both the flexibility of chamber’s processing capability and the constraints of shared resources make the scheduling (i.e., resource allocation) and performance evaluation to be very complicated. The objective of this research is to develop a approach, based on the CTOPN (Colored Timed Object-oriented Petri Net) model, for modeling and scheduling a multi-chamber cluster tool system.
50
李忠一. "Fuzzy Colored Timed Petri Net Model in Network Flow Control and Distributed FMC Emulator Design." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/33450993715025233834.
Full textAbstract:
碩士<br>國立臺灣大學<br>機械工程研究所<br>84<br>A distributed manufacturing system primarily consists of several sub-systems, computer network, and coordination controller. The FMC (Flexible Manufacturing Cell) and FMS (Flexible Manufacturing System) are two typical modified distributed system. Namely, they are distributed control in nature but with centralized coordination. Hence, network flow control, modeling and uncertainty management and the coordination are very complicated. This thesis proposes a fuzzy colored timed Petri net (F-CTPN) tool to model uncertainty and handle the network flow control. The proposed network control is OSI session-layer-based network flow fuzzy control.
The communication system in the proposed distributed system has client-server and peer to peer features. In other words, it is central management with distributed control. In the thesis, the FMC emulator is first constructed then the network flow management based on F-CTPN is developed.