• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 128
  • 120
  • 42
  • 26
  • 12
  • 6
  • 4
  • 4
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 382
  • 382
  • 120
  • 117
  • 53
  • 52
  • 51
  • 50
  • 45
  • 43
  • 39
  • 37
  • 37
  • 33
  • 32
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Formal data flow diagrams (FDFD) : a petri-net based requirements specification language /

Pong, Lih. January 1985 (has links)
Thesis--M. Phil., University of Hong Kong, 1986.

Noodle: a three-dimensional net-based object-oriented development environment

鄭則平, Cheng, Chuk-ping. January 1994 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy

Performance analysis of queueing networks via Taylor series expansions

Seo, Dong-Won 08 1900 (has links)
No description available.

Parallel simulation of marked graphs

Sellami, Hatem 05 1900 (has links)
No description available.

Mobiliosios informavimo sistemos tyrimas / Exploration of mobile information system

Kaškelevičius, Darius 24 May 2005 (has links)
This work is dedicated to the making and research of mobile information system. Following tasks were completed in order to tackle this problem: mobile information system processes analysis; uml modeling analysis; formal modeling methods analysis; composition of system model; system model verification.

PEM - Modelo de Ejecución Paralela basado en redes de Petri

Wolfmann, Aaron Gustavo Horacio January 2015 (has links)
El objetivo de la tesis es la definición de un modelo de ejecución paralelo, que basado en la representación de un algoritmo paralelo con Redes de Petri, permita a un conjunto flexible de procesadores independientes entre sí, ejecutar el algoritmo en forma asíncrona con altos rendimientos y que el programador tenga capacidad de ajustar los parámetros de ejecución en vista de mejoras de rendimiento. Los fundamentos son claros: se desea contar con una herramienta de ejecución de programas paralelos que permita modelar el algoritmo, y pasar del modelo a la ejecución asíncrona preservando el modelo. Las Redes de Petri son la herramienta básica e indiscutiblemente pertinente para lograr el objetivo. Un desafío es cubrir la brecha o gap existente entre el modelado y una ejecución del programa paralelo de rendimientos aceptables y escalables.Para ello, debe existir una vinculación del modelo con un conjunto de unidades de procesamiento que corran en paralelo.

A study of deadlocks and traps in petri nets

Bagga, Kunwarjit Singh January 1988 (has links)
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 Petri nets are also determined. / Department of Computer Science

Synthesis and axiomatisation for structural equivalences in the Petri Box Calculus

Hesketh, Martin January 1998 (has links)
The Petri Box Calculus (PBC) consists of an algebra of box expressions, and a corresponding algebra of boxes (a class of labelled Petri nets). A compo- sitional semantics provides a translation from box expressions to boxes. The synthesis problem is to provide an algorithmic translation from boxes to box expressions. The axiomatisation problem is to provide a sound and complete axiomatisation for the fragment of the calculus under consideration, which captures a particular notion of equivalence for boxes. There are several alternative ways of defining an equivalence notion for boxes, the strongest one being net isomorphism. In this thesis, the synthesis and axiomatisation problems are investigated for net semantic isomorphism, and a slightly weaker notion of equivalence, called duplication equivalence, which can still be argued to capture a very close structural similarity of con- current systems the boxes are supposed to represent. In this thesis, a structured approach to developing a synthesis algorithm is proposed, and it is shown how this may be used to provide a framework for the production of a sound and complete axiomatisation. This method is used for several different fragments of the Petri Box Calculus, and for gener- ating axiomatisations for both isomorphism and duplication equivalence. In addition, the algorithmic problems of checking equivalence of boxes and box expressions, and generating proofs of equivalence are considered as extensions to the synthesis algorithm.

Petri net and statechart models for structured programmable logic controller software development /

Mlilo, Njabulo. Unknown Date (has links)
Thesis (MEng)--University of South Australia, 1997

A recursive algorithm to prevent deadlock in flexible manufacturing systems

Landrum, Chad Michael. January 2000 (has links)
Thesis (M.S.)--Ohio University, August, 2000. / Title from PDF t.p.

Page generated in 0.0651 seconds