Увійти

Готові списки джерел за темами / Petri nets / Дисертації

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Petri nets.

Дисертації з теми "Petri nets"

Автор: Grafiati

Опубліковано: 4 червня 2021

Оновлено: 25 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 дисертацій для дослідження на тему "Petri nets".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

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.

Повний текст джерела

Анотація:

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 th

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Jin, Wei. "Petri nets and their applications." Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/774753.

Повний текст джерела

Анотація:

Petri nets are named in honor of Dr. Carl A. Petri for his famous Ph.D dissertation of general net theory in 1962. A substantial amount of work utilizing and modifying the Petri nets has been done since then, and they have turned out to be very useful in the study of asynchronous concurrent systems. The liveness and reachability problems are considered to be some of the major problems in Petri net theory.Since the structure of a Petri net can be regarded as sets of places and transitions form a graphical point of view, this thesis is concerned with utilizing the results of graph theory to inve

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Dahlbom, Anders. "Petri nets for situation recognition." Doctoral thesis, Örebro universitet, Akademin för naturvetenskap och teknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-13089.

Повний текст джерела

Анотація:

Situation recognition is a process with the goal of identifying a priori defined situations in a flow of data and information. The purpose is to aid decision makers with focusing on relevant information by filtering out situations of interest. This is an increasingly important and non trivial problem to solve since the amount of information in various decision making situations constantly grow. Situation recognition thus addresses the information gap, i.e. the problem of finding the correct information at the correct time. Interesting situations may also evolve over time and they may consist o

Стилі APA, Harvard, Vancouver, ISO та ін.

4

David, Nicolas. "Discrete Parameters in Petri Nets." Thesis, Nantes, 2017. http://www.theses.fr/2017NANT4108/document.

Повний текст джерела

Анотація:

Afin de permettre une modélisation plus souple des systèmes, nous proposons d’étendre les réseaux de Petri par des paramètres discrets représentant le poids des arcs ou le nombre de jetons présents dans les places. Dans ce modèle, tout problème de décision peut être décliné sous deux versions, une universelle, demandant si la propriété considérée est vraie quelles que soient les valeurs que prennent les paramètres et une existentielle, qui s’interroge sur l’existence d’une valeur pour les paramètres telle que la propriété soit satisfaite. Concernant la couverture, nous montrons que ces deux pr

Стилі APA, Harvard, Vancouver, ISO та ін.

5

BARROSO, GIOVANNI CORDEIRO. "A STUDY ON COLORED PETRI NETS AND A PROGRAM TO ANALYZE COLORED PETRI NETS: ANARCO." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1987. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14192@1.

Повний текст джерела

Анотація:

A modelagem de sistemas que apresentam subsistemas idênticos, por intermédio de Redes de Petri, conduz à geração de grafos de grandes dimensões com diversos componentes indênticos. As extensões às Redes de Petri que permitem diferenciar estes diversos subsistemas, por intermédio da distinção das fichas nelas contidas, receberam o nome de Redes de Petri Coloridas. Neste trabalho, são apresentados algumas propostas existentes na literatura sobre Redes de Petri Coloridas, bem como é desenvolvido um programa de análise baseado em uma dessas propostas - a de kurt Jensen. O programa analisa as propr

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Masapati, Gulammahammad Hasanasaheb. "Performance prediction using timed Petri nets." Thesis, University of Ottawa (Canada), 1987. http://hdl.handle.net/10393/5155.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Kyratzoglou, I. M. (Ioannis M. ). "Computer aided design for Petri Nets." Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14669.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Ghahremani, Azghandi Nargess. "Petri nets, probability and event structures." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/9936.

Повний текст джерела

Анотація:

Models of true concurrency have gained a lot of interest over the last decades as models of concurrent or distributed systems which avoid the well-known problem of state space explosion of the interleaving models. In this thesis, we study such models from two perspectives. Firstly, we study the relation between Petri nets and stable event structures. Petri nets can be considered as one of the most general and perhaps wide-spread models of true concurrency. Event structures on the other hand, are simpler models of true concurrency with explicit causality and conflict relations. Stable event str

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Li, Yao Carleton University Dissertation Engineering Electrical. "Solution techniques for stochastic petri nets." Ottawa, 1992.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

MASCHERONI, MARCO. "Hypernets: a class of hierarchical petri nets." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2011. http://hdl.handle.net/10281/19228.

Повний текст джерела

Анотація:

The interest of this thesis is on modeling systems of mobile agents, systems composed of several open and autonomous components which can interact and move inside one or more environments. Several proposal for modeling mobility have been introduced. They can be roughly divided in two categories: Petri net based formalisms, and process algebra based formalisms. In this thesis, Petri net formalisms will mostly be considered, with particular care to formalisms which use the nets-within-nets paradigm. In models compliant to this paradigm the tokens of a Petri net can be nets themselves. Sin

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Tanabe, Makoto. "Timed Petri Nets and Temporal Linear Logic." 京都大学 (Kyoto University), 1999. http://hdl.handle.net/2433/181934.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Shaw, Oliver James. "Modelling bacterial regulatory networks with Petri nets." Thesis, University of Newcastle Upon Tyne, 2007. http://hdl.handle.net/10443/1963.

Повний текст джерела

Анотація:

To exploit the vast data obtained from high throughput molecular biology, a variety of modelling and analysis techniques must be fully utilised. In this thesis, Petri nets are investigated within the context of computational systems biology, with the specific focus of facilitating the creation and analysis of models of biological pathways. The analysis of qualitative models of genetic networks using safe Petri net techniques was investigated with particular reference to model checking. To exploit existing model repositories a mapping was presented for the automatic translation of models encode

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Hall, Jon G. "An algebra of high level Petri nets." Thesis, University of Newcastle Upon Tyne, 1996. http://hdl.handle.net/10443/2166.

Повний текст джерела

Анотація:

Petri nets were introduced by C.A. Petri as a theoretical model of concurrency in which the causal relationship between actions, rather than just their temporal ordering, can be represented. As a theoretical model of concurrency, Petri nets have been widely successful. Moreover, Petri nets are popular with practitioners, providing practical tools for the designer and developer of real concurrent and distributed systems. However, it is from this second context that perhaps the most widely voiced criticism of Petri nets comes. It is that Petri nets lack any algebraic structure or modularity, and

Стилі APA, Harvard, Vancouver, ISO та ін.

14

English, Sarah L. "Coloured Petri Nets for object-oriented modelling." Thesis, University of Brighton, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334740.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

VIEIRA, BRUNO LOPES. "EXTENDING PROPOSITIONAL DYNAMIC LOGIC FOR PETRI NETS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2014. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=24052@1.

Повний текст джерела

Анотація:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>PROGRAMA DE EXCELENCIA ACADEMICA<br>Lógica Proposicional Dinâmica (PDL) é um sistema lógico multi-modal utilizada para especificar e verificar propriedades em programas sequenciais. Redes de Petri são um formalismo largamente utilizado na especificação de sistemas concorrentes e possuem uma interpretação gráfica bastante intuitiva. Neste trabalho apresentam-se extensões da Lógica Proposicional Dinâmica onde os pro

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Wiley, Richard Paul. "Performance analysis of Stochastic Timed Petri Nets." Thesis, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/15002.

Повний текст джерела

Анотація:

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.

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Cesco, Arnaldo. "Decidability Of Strong Equivalences For Finite Petri Nets." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23293/.

Повний текст джерела

Анотація:

Tra i vari modelli di sistemi concorrenti e distribuiti proposti, le reti di Petri finite sono uno dei più studiati ed adatti alla descrizione di questo tipo di sistemi, poiché ne ricalcano le qualità distintive. Infatti, lo stato globale di una rete di Petri è formato da una collezione (detta marking) di stati locali (detti token). L'esecuzione di una transizione è una trasformazione locale che riguarda solo una parte dei token in un marking. Pertanto, si può interpretare un token come un processo sequenziale ed un marking come un sistema distribuito che porta avanti una computazione più co

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Lucic, Diana. "On exact equilibrium distributions of stochastic Petri nets /." Title page, contents and summary only, 1990. http://web4.library.adelaide.edu.au/theses/09PH/09phl937.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Coleman, James L. "Stochastic Petri Nets with product form equilibrium distributions /." Title page, contents and summary only, 1993. http://web4.library.adelaide.edu.au/theses/09PH/09phc6922.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Djemame, Karim. "Distributed simulation of high-level algebraic Petri nets." Thesis, University of Glasgow, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.301624.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Usher, Michelle M. "A concurrent visual language based on Petri nets." Thesis, University of Liverpool, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366506.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Ng, Hoi Sum. "Petri nets for fault diagnosis and distribution automation." Thesis, University of Strathclyde, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366530.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Bilinski, Krzysztof. "Application of Petri nets in parallel controller design." Thesis, University of Bristol, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.336830.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Thal, Brent. "A Robust System Maturity Model Using Petri Nets." Thesis, The George Washington University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10838208.

Повний текст джерела

Анотація:

<p> Immature systems can be plagued by high costs, high risks, and schedule delays. System maturity models are utilized to quantitatively analyze a system’s readiness to indicate whether the system is prepared to proceed to the next acquisition phase during development. Most system maturity models are not robust enough to properly represent a system and assess its capabilities. Contemporary maturity models focus on individual technologies and fail to portray the importance of the integrations between technologies. System Readiness Level (SRL) was introduced to incorporate integration int

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Li, Yao Carleton University Dissertation Engineering Electrical. "The harmony operating system described by Petri Nets." Ottawa, 1986.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Stojic, Ivan <1982&gt. "Algorithms for stationary analysis of stochastic Petri nets." Doctoral thesis, Università Ca' Foscari Venezia, 2016. http://hdl.handle.net/10579/10300.

Повний текст джерела

Анотація:

Stochastic Petri nets (SPN) are a Markovian formalism for qualitative and quantitative analysis of discrete event dynamic systems. Among other uses, they have been used extensively in performance evaluation of telecommunication systems, computer systems and networks. Analysis of an SPN model usually requires stationary analysis of a continuous-time Markov chain (CTMC) underlying the SPN, whose state space for many practical models is too large to be analysed by direct methods. This serious drawback is shared with many other modelling formalisms and is usually referred to as state space explosi

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Turaev, Sherzod. "Petri net controlled grammars." Doctoral thesis, Universitat Rovira i Virgili, 2010. http://hdl.handle.net/10803/8799.

Повний текст джерела

Анотація:

Different types of regulated grammars have been introduced in order to supplement shortcomings of context-free grammars in applications preserving their elegant mathematical properties. However, the rapid developments in present day industry, biology, and other areas challenge to deal with various tasks which need suitable tools for their modelling and investigation. We propose Petri net controlled grammars as models for representing and analyzing of metabolic pathways in living cells where Petri nets are responsible for the structure and communication of the pathways, and grammars represent b

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Pocci, Marco. "Test and diagnosis of discrete event systems using Petri nets." Thesis, Aix-Marseille, 2013. http://www.theses.fr/2013AIXM4336/document.

Повний текст джерела

Анотація:

Le test d’identification d’état d’un système à événement discret (SED) a pour but d’en identifier l’état final, lorsque son état initial est inconnu. Une solution classique à ce problème, en supposant que le SED n’ait pas de sorties observables, consiste à déterminer une séquences de synchronisation, c.à-d., une séquence d’événements d’entrée qui conduit le SED sur un état connu. Ce problème a été résolu dans les années 60’ à l’aide des automates. L’objectif principal de cette thèse est d’utiliser les réseaux de Petri (RdP) pour obtenir une résolution plus optimal de ce problème et pour une pl

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Tarasyuk, Igor V. "Tau-Equivalences and Refinement for Petri Nets Based Design." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-100370.

Повний текст джерела

Анотація:

The paper is devoted to the investigation of behavioral equivalences of concurrent systems modeled by Petri nets with silent transitions. Basic τ-equivalences and back-forth τ-bisimulation equivalences known from the literature are supplemented by new ones, giving rise to complete set of equivalence notions in interleaving / true concurrency and linear / branching time semantcis. Their interrelations are examined for the general class of nets as well as for their subclasses of nets without siltent transitions and sequential nets (nets without concurrent transitions). In addition, the preservat

Стилі APA, Harvard, Vancouver, ISO та ін.

31

NISHIMURA, Yoshiyuki, Katsuaki ONOGI, Yutaka MATSUTANI, Yasushi MITSUYAMA, and Susumu HASHIZUME. "Construction of Petri Nets from a Given Partial Language." Institute of Electronics, Information and Communication Engineers, 1996. http://hdl.handle.net/2237/14962.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Konios, Alexandros. "Modelling and verification of ambient systems using Petri nets." Thesis, University of Newcastle upon Tyne, 2015. http://hdl.handle.net/10443/3054.

Повний текст джерела

Анотація:

The expeditious development of technology in the past decades resulted in the introduction of concurrent systems that incorporate both ubiquitous and pervasive computing, the ambient systems. These systems are named after their ability to be completely embedded in the environment in which they operate and interact with the users, in a silent and non distracting way, facilitating the completion of their tasks. Hence, there is a growing need to introduce and develop formal techniques for computational models capable of faithfully modelling the behaviour of these systems. One way of capturing the

Стилі APA, Harvard, Vancouver, ISO та ін.

33

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

34

ONOGI, Katsuaki, Hidekazu KURIMOTO, Susumu HASHIZUME, Takashi ITO, and Tomoyuki YAJIMA. "Control of Batch Processes Based on Hierarchical Petri Nets." Institute of Electronics, Information and Communication Engineers, 2004. http://hdl.handle.net/2237/14963.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Bagga, Kunwarjit Singh. "A study of deadlocks and traps in petri nets." Virtual Press, 1988. http://liblink.bsu.edu/uhtbin/catkey/544009.

Повний текст джерела

Анотація:

Petri nets are used as models in the study of networks involving information flows. Petri nets have also turned out to be useful in the study of many asynchronous concurrent systems.In this thesis, the notions of deadlocks, traps, and liveness are considered from a graph theoretic viewpointA characterization of minimal deadlocks and traps in Petri nets is obtained. For the complete Petri nets, alternative characterizations of deadlocks and traps are obtained. Necessary and sufficient conditions are obtained for complete Petri nets to be deadlock free. Similar conditions for trap free complete

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Loch, Fredrik. "Proving liveness properties of concurrent programs using petri-nets." Thesis, Umeå universitet, Institutionen för datavetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-92803.

Повний текст джерела

Анотація:

With the increased scale of distributed computations the complexity of liveness proofs have increased. In this paper we endeavor to simplify the process of verifying a concurrent system using well know modeling techniques. The choice of modeling tool as well as the proof is based on future scalability and automation. We translate the formal proof to a petri-net representation and use this to verify basic algorithms. We show that the formal proof of liveness stated by Owiki and Lamport can be adapted to petri-nets. We also show a modification to petri-nets for increased granularity in loop mode

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Grecco, Albert J. "AdaFlow: the automation of software analysis using Petri Nets." Thesis, Monterey, California. Naval Postgraduate School, 1988. http://hdl.handle.net/10945/22853.

Повний текст джерела

Анотація:

There is considerable interest in the development of Ada-based, automated software tools to aid in the development and testing of embedded, real-time software. The Naval Postgraduate School has already implemented automated Ada metric tools at the request of the Naval Weapons Center, China Lake. This thesis is the preliminary work for a new automated software analysis tool entitled AdaFlow. This tool, which is written in Ada, takes Ada programs as input, and translates the source code to a Petri net model. This Petri net model provides the user with the capability to perform automated, interac

Стилі APA, Harvard, Vancouver, ISO та ін.

38

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Sananikone, Dang S. "Cosynthesis of embedded systems using coloured interpreted petri nets." Thesis, University of Aberdeen, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320764.

Повний текст джерела

Анотація:

The rising complexity in systems design, and the shift in the hardware/software functionality boundary has spurred research into development of EDA (Electronic Design Automation) tools at the systems level. Codesign is a methodology that proposes an integrated approach to systems design unifying both hardware and software approaches. Cosynthesis is a major field of research within codesign; cosynthesis takes a behavioural description and generates a hardware/software partition which satisfies system constraints. Current research is concerned with the automatic partitioning of systems. COSYN wa

Стилі APA, Harvard, Vancouver, ISO та ін.

40

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.

Повний текст джерела

Анотація:

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.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Remy, Pascal A. "On the generation of organizational architectures using Petri nets." Thesis, Massachusetts Institute of Technology, 1986. http://hdl.handle.net/1721.1/14937.

Повний текст джерела

Анотація:

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.<br>MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.<br>Bibliography: leaves 185-187.<br>by Pascal A. Remy.<br>M.S.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Brown, Carolyn T. "Linear logic and Petri nets : categories, algebra and proof." Thesis, University of Edinburgh, 1990. http://hdl.handle.net/1842/15424.

Повний текст джерела

Анотація:

This thesis explores three ways in which linear logic may be used to define a specification language for Petri nets, by giving precise correspondences, at different levels, between linear logic and Petri nets. Firstly, we define categories NC by analogy with de Paiva's dialectica categories GC. The category NSet has as objects the elementary Petri nets and morphisms refinement maps. We show that GC induces in NC sufficient structure for NC to be a sound model of linear logic. We demonstrate the computational significance of the net constructors induced by the interpretations in NSet of the lin

Стилі APA, Harvard, Vancouver, ISO та ін.

43

PAYAL. "ON SIGNED PETRI NETS." Thesis, 2023. http://dspace.dtu.ac.in:8080/jspui/handle/repository/20370.

Повний текст джерела

Анотація:

In today’s complex scenario of technological advancement, the role of event-driven discrete dynamical systems have an impact on man’s ability to fast-forward the futuristic technologies that are likely to bring unimaginable progress in our time, and near, far futures. One such great innovation that inspired this thesis is the "Theory of Petri nets", a modeling tool for event-driven discrete dynamical systems. The study of Petri nets and its various extensions that have developed over time is one of the most active and vibrant areas of research in current time, owing to its applications

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Nicdao, Jose Marcelino Arrozal, and 廖扶西. "Fundamental Structures in Petri Nets." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/21450361311514773457.

Повний текст джерела

Анотація:

碩士<br>國立政治大學<br>資訊管理學系<br>88<br>The thesis contributes to the theoretical study of Petri net theory. We conduct boundedness and liveness structural analysis of Synchronized Choice nets (SNC) based on fundamental structures in Petri nets and identified as first-order structures. By studying these structures, the study proposes two ways of preserving good properties: addition of second-order structures or other asymmetric structures. Liveness of these new SNC nets is studied based on the concept of siphons and traps. We prove that SNC nets thus formed are structurally bounded and live. The thesi

Стилі APA, Harvard, Vancouver, ISO та ін.

45

XIE, GUI-YUAN, and 謝貴淵. "Transforming programs into petri Nets." Thesis, 1992. http://ndltd.ncl.edu.tw/handle/07508189037045719130.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Lin, Yuh-Der, and 林育德. "Parallel Timed Petri Nets Simulator." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/19679176843138246348.

Повний текст джерела

Анотація:

碩士<br>淡江大學<br>資訊工程研究所<br>83<br>Petri Nets（PN）是一種以正規方法（formal method）來描述和分析系統行為的工具，特別是針對具有同時性（concurrent）與非同步特性 asynchronous）的系統。將時間引入Petri Nets之中（即所謂的Timed Petri Nets），則更能有效地對所描述的系統做作效能評估（ performance evaluation），例如Timed Petri Nets已被廣泛地應用在對分散式系統（ distributed system）的效能分析上。隨著所描述系統之複雜度（complexity）不斷地擴增，Petri Nets的網路結構（net structure）也變得更為複雜，以analytical的方式對Petri Nets作分析則因記憶體（memory）與複雜度要求過高而變得不可行，而傳統上採用離散事件模擬（discrete-event simulation）方式的循序Timed Petri

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Shiau, Yuh-Shin, and 蕭毓欣. "New Methods for Knowledge Representation and Reasoning Using Extended Fuzzy Petri Nets and Time Petri Nets." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/59329606435635902582.

Повний текст джерела

Анотація:

碩士<br>國立交通大學<br>資訊科學學系<br>86<br>In this thesis, we present an extended fuzzy Petri net model to model fuzzy IF-THEN rules and fuzzy IF-THEN-ELSE rules of rule- based systems. We also develop an efficient algorithm for performing vague reasoning automatically based on the extended fuzzy Petri net model. The proposed algorithm allows the computers to perform reasoning in a more flexible and more intelligent manner. Based on the proposed vague reasoning algorithm, we have implemented a vague r

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Fan, Chu-Kai, and 范崇愷. "Elevator Dynamic Simulation Using Petri Nets." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/41371855756788488008.

Повний текст джерела

Анотація:

碩士<br>國立成功大學<br>航空太空工程學系<br>86<br>The aim of this dissertation is to realize the elevator discrete event dynamics duo to the traveling request using Petri nets. Based on the proposed representation scheme, the efficiency of elevator group can be analysed. Properties of the Petri nets are introduced. An extended colored Petri net is proposed to construct elevator dynamic model. The proposed single elevator dynamic model can be modularized and extended to multi-elevator case

Стилі APA, Harvard, Vancouver, ISO та ін.

49

She, Ta-Lun, and 佘達綸. "VoIP Fault Detection Using Petri Nets." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/89673634186161166836.

Повний текст джерела

Анотація:

碩士<br>逢甲大學<br>資訊工程所<br>95<br>Voice over Internet Protocol (VoIP) is not limited to the transmission of voice packets, but integrates video, voice mail, and multimedia, all at a low cost. An increasing number of agencies, enterprises, and schools are designing and deploying IP telephony networks. Session Initiation Protocol Internet Protocol Private Branch Exchanges (SIP IP-PBXs) and Internet Telephony Gateways (ITGs) can connect with other Internet Telephony Service Providers (ITSPs) to take advantage of tremendous savings in long-distance and international calling. Currently one obstacle to t

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Wang, Bo Yao, and 王柏堯. "Verifying temporal properties of petri nets." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/45568210926471806215.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!