• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 116
  • 100
  • 42
  • 20
  • 9
  • 6
  • 3
  • 3
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 335
  • 335
  • 110
  • 102
  • 53
  • 45
  • 45
  • 45
  • 42
  • 40
  • 38
  • 36
  • 29
  • 29
  • 29
  • 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.

A hardware-software co-design system for embedded real-time applications

Cavalcante, Sergio Vanderlei January 1997 (has links)
No description available.

Automated translation of dynamic programming problems to Java code and their solution via an intermediate Petri net representation

Mauch, Holger January 2005 (has links)
Thesis (Ph. D.)--University of Hawaii at Manoa, 2005. / Includes bibliographical references (leaves 197-202). / Also available by subscription via World Wide Web / xi, 202 leaves, bound ill. 29 cm

The use of Petri Nets to Personal process modeling and verification

Chen, Lin-Ya 27 July 2005 (has links)
A personal process is a coordination of personal activities, each requiring a joint effort between a user and an enacting organization. In this thesis, we model a personal process using Petri Nets to describe both the control flow and data flow pertaining to the personal process. We redefine the correctness of a personal process and address the verification method based on Petri Nets. In our architecture, we add an online execution engine for the user to execute and verify the correctness of a personal process in real time¡@through the Internet. A personal process can also be managed by a personal workflow management system (PWFMS) running on a handheld device. Because of the strict limitations on their computation power and battery consumptions, we support verification only when the wireless connection is available.

Automated translation of dynamic programming problems to Java code and their solution via an intermediate Petri net representation

Mauch, Holger. January 2005 (has links)
Thesis (Ph. D.)--University of Hawaii at Manoa, 2005. / Includes bibliographical references (leaves 197-202).

Engineering communicative distributed safety-critical systems

Birkinshaw, Carl Ian January 1995 (has links)
No description available.

A three-dimensional modeling approach to Petri network design and modeling

Dance, Linda Kaye, January 2001 (has links) (PDF)
Thesis (M.E.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains xiii, 103 p.; also contains graphics. Vita. .Avi file containing movie (referred to in abstract) is missing. Includes bibliographical references (p. 101-102).

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.

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.

Verifying temporal properties of systems with applications to petri nets

Bradfield, Julian Charles January 1991 (has links)
This thesis provides a powerful general-purpose proof technique for the verification of systems, whether finite or infinite. It extends the idea of finite local model-checking, which was introduced by Stirling and Walker: rather than traversing the entire state space of a model, as is done for model-checking in the sense of Emerson, Clarke et al. (checking whether a (finite) model satisfies a formula), local model-checking asks whether a particular state satisfies a formula, and only explores the nearby states far enough to answer that question. The technique used was a tableau method, constructing a tableau according to the formula and the local structure of the model. This tableau technique is here generalized to the infinite case by considering sets of states, rather than single states; because the logic used, the propositional modal mu-calculus, separates simple modal and boolean connectives from powerful fix-point operators (which make the logic more expressive than many other temporal logics), it is possible to give a relatively straightforward set of rules for constructing a tableau. Much of the subtlety is removed from the tableau itself, and put into a relation on the state space defined by the tableau-the success of the tableau then depends on the well-foundedness of this relation. This development occupies the second and third chapters: the second considers the modal mu-calculus, and explains its power, while the third develops the tableau technique itself The generalized tableau technique is exhibited on Petri nets, and various standard notions from net theory are shown to play a part in the use of the technique on nets-in particular, the invariant calculus has a major role. The requirement for a finite presentation of tableaux for infinite systems raises the question of the expressive power of the mu-calculus. This is studied in some detail, and it is shown that on reasonably powerful models of computation, such as Petri nets, the mu-calculus can express properties that are not merely undecidable, but not even arithmetical. The concluding chapter discusses some of the many questions still to be answered, such as the incorporation of formal reasoning within the tableau system, and the power required of such reasoning.

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

Page generated in 0.0886 seconds