• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 128
  • 121
  • 42
  • 26
  • 12
  • 6
  • 4
  • 4
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 383
  • 383
  • 120
  • 117
  • 53
  • 52
  • 52
  • 50
  • 45
  • 43
  • 39
  • 38
  • 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.
51

Distributed generation of state space for timed Petri nets /

Rada, Irina, January 2000 (has links)
Thesis (M.Sc.)--Memorial University of Newfoundland, 2000. / Bibliography: p. 79-84.
52

Semi-formal verifcation of analog mixed signal systems using multi-domain modeling languages

Ramirez, Ricardo, active 2013 18 December 2013 (has links)
The verification of analog designs has been a challenging task for a few years now. Several approaches have been taken to tackle the main problem related to the complexity that such task presents to design and verification teams. The methodology presented in this document is based on the experiences and research work carried out by the Concordia University's Hardware Verification and the U. of Texas' IC systems design groups. The representation of complex systems where different interactions either mechanical or electrical take place requires an intricate set of mathematical descriptions which greatly vary according to the system under test. As a simple and very relevant example one can look at the integration of RF-MEMS as active elements in System-On-Chip architectures. In order to tackle such heterogeneous interaction for a consistent model, the use of stochastic hybrid models is described and implemented for very simple examples using high level modeling tools for a succinct and precise description. / text
53

Foundation of Aspect Oriented Business Process Management

Jalali, Amin January 2012 (has links)
Reducing the complexity in information systems is a main concern on which researchers work. Separation of concerns, also known as the principle of ‘divide and conquer’, has long time been a strategy for dealing with complexity. Two examples of the application of this principle in the area of information system design are the break out the data management into Database Management Systems(DBMSs) and the separation of the business logic from the application logic into Business Process Management Systems (BPMSs). However, separation of cross-cutting concerns from the core-concern of a business process is not yet supported in the Business Process Management (BPM) area. Aspect Oriented principle recommends such a separation. When looking into the business process, several concerns, such as security and privacy, can be identified. Therefore, a formal model that provides a foundation for enabling BPMSs to support separation of concerns in BPM area is needed. This thesis provides a formal model for dealing with separation of concerns in the BPM area. Implementing this model in BPMSs would facilitate the design and implementation of business processes with a lower level of complexity, which in turn would reduce the costs associated with BPM projects. The thesis starts with a literature review on aspect orientation both in programming and in the BPM areas. Based on this study, a list of requirements for an Aspect Oriented Service for BPMSs is compiled. Then a formal model for such a service, fulfilling a set of these requirements, is designed using Coloured Petri Nets and implemented in CPN Tools. The model is evaluated through the execution of a number of scenarios. The solution is also validated through an industrial case study. The results of the case study are presented the direction for future work outlined. The case study demonstrates that separation of concerns through aspect orientation does indeed reduce the complexity of business process models.
54

Formal data flow diagrams (FDFD): a petri-netbased requirements specification language

Pong, Lih, 龐立 January 1985 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy
55

Audio browsing of automaton-based hypertext

Ustun, Selen 30 September 2004 (has links)
With the wide-spread adoption of hypermedia systems and the World Wide Web (WWW) in particular, these systems have evolved from simple systems with only textual content to those that incorporate a large content base, which consists of a wide variety of document types. Also, with the increase in the number of users, there has grown a need for these systems to be accessible to a wider range of users. Consequently, the growth of the systems along with the number and variety of users require new presentation and navigation mechanisms for a wider audience. One of the new presentation methods is the audio-only presentation of hypertext content and this research proposes a novel solution to this problem for complex and dynamic systems. The hypothesis is that the proposed Audio Browser is an efficient tool for presenting hypertext in audio format, which will prove to be useful for several applications including browsers for visually-impaired and remote users. The Audio Browser provides audio-only browsing of contents in a Petri-based hypertext system called Context-Aware Trellis (caT). It uses a combination of synthesized speech and pre-recorded speech to allow its user to listen to contents of documents, follow links, and get information about the navigation process. It also has mechanisms for navigating within documents in order to allow users to view contents more quickly.
56

Structural analysis and control of resource allocation systems using petri nets

Park, Jonghun 12 1900 (has links)
No description available.
57

Augmenting Petri Nets to Model Health-Care Protocols

Whittaker, Sarah-Jane 28 September 2011 (has links)
An outbreak of an infectious illness can have a devastating impact on a population. Once confirmed, local health care organizations will attempt to reduce the spread of the disease by adopting a set of pre-defined guidelines. Modelling such a system presents a number of unique challenges: timing and probability constraints must be captured, scaling must be seamless and methods for analysis must be robust and efficient. To satisfy these requirements, an augmented form of Petri net known as a choice-point net is introduced in this thesis. In this data structure, timing is associated with event-based transitions that may fire multiple times to simulate the same event occurring several times in parallel. Events may result in several possible outcomes, or choices, each of which is given a probability of occurrence. A choice-point net may be scaled without requiring structural changes to the model and may be analyzed by unravelling it into a finite-state automaton representing (perhaps portions of) its behaviour. By translating questions about the protocol into the mathematical language of the net, recursive algorithms may then be employed to provide health-care professionals with answers to their questions. To demonstrate the expressiveness of choice-point nets, an actual, in-use protocol to control respiratory infection outbreaks in long-term care homes is modelled. Three similar abridged scenarios set in a small long-term care home are also modelled, analyzed and compared. / Thesis (Ph.D, Computing) -- Queen's University, 2011-09-27 21:23:16.13
58

Synthesis of orchestrators from service choreographies

McIlvenna, Stephen January 2009 (has links)
With service interaction modelling, it is customary to distinguish between two types of models: choreographies and orchestrations. A choreography describes interactions within a collection of services from a global perspective, where no service plays a privileged role. Instead, services interact in a peer-to-peer manner. In contrast, an orchestration describes the interactions between one particular service, the orchestrator, and a number of partner services. The main proposition of this work is an approach to bridge these two modelling viewpoints by synthesising orchestrators from choreographies. To start with, choreographies are defined using a simple behaviour description language based on communicating finite state machines. From such a model, orchestrators are initially synthesised in the form of state machines. It turns out that state machines are not suitable for orchestration modelling, because orchestrators generally need to engage in concurrent interactions. To address this issue, a technique is proposed to transform state machines into process models in the Business Process Modelling Notation (BPMN). Orchestrations represented in BPMN can then be augmented with additional business logic to achieve value-adding mediation. In addition, techniques exist for refining BPMN models into executable process definitions. The transformation from state machines to BPMN relies on Petri nets as an intermediary representation and leverages techniques from theory of regions to identify concurrency in the initial Petri net. Once concurrency has been identified, the resulting Petri net is transformed into a BPMN model. The original contributions of this work are: an algorithm to synthesise orchestrators from choreographies and a rules-based transformation from Petri nets into BPMN.
59

Modelling and analysis of the resource reservation protocol using coloured petri nets /

Villapol Blanco, Maria Elena. Unknown Date (has links)
The Resource Reservation Protocol (RSVP) is one of the proposals of the Internet Engineering Task Force (IETF) for conveying Quality of Service (QoS) related information in the form of resource reservations along the communication path. The RSVP specification (i.e. Request for Comments 2205) provides a narrative description of the protocol without any use of formal techniques. -- abstract. / Thesis (PhD)--University of South Australia, 2003.
60

Verification of the WAP transaction layer using coloured petri nets /

Gordon, Steven Donald. Unknown Date (has links)
Thesis (PhD)--University of South Australia, 2001

Page generated in 0.0578 seconds