From the bitsavers.org collection, a scanned-in computer-related document. xerox :: parc :: techReports :: SSL-79-6 Computer Science and Office Information Systems
Topics: office, ois, user, officetalk, system, systems, distributed, bdl, icn, activity, work station, work...
From the bitsavers.org collection, a scanned-in computer-related document. mit :: lcs :: tr :: MIT-LCS-TR-181
Topics: petri, tokens, places, reachability, polynomial, bounded, recursive, firing, finite, net, petri...
Works presented in this paper deal with the robustness of manufacturing job‐shops with time constraints. A computing algorithm of a lower bound of the maximal time disturbances allowed in a given point is provided. To demonstrate the effectiveness and accuracy of this algorithm, two industrial examples are depicted. The possession of this bound allows checking the death of marks without the generation of too many false alarms. From a practical point of view, the death of a mark corresponds to...
Topics: P-time Petri Net, Manufacturing System, Passive Robustness, Sojourn Time Constraints, Time...
Fault trees and Petri nets are two widely accepted graphical tools used in the safety analysis of software. Because some software is life and property critical, thorough analysis techniques are essential. Independently Petri nets and fault trees serve limited evaluation purposes. This thesis presents a technique that converts and links Petri nets to fault trees and fault trees to Petri nets. It enjoys the combinational benefits of both analysis tools. Software Fault Tree Analysis and timed...
Topics: Computer science, Software engineering, Graphic methods., Software Safety, Petri Net, Fault Tree,...
Naval Postgraduate School
4
4.0
Feb 2, 2021
02/21
by
Jennings, Stephen Craig; Hartel, Robert John
texts
eye 4
favorite 0
comment 0
Current technologies in the fields of telecommunications and computer processing are becoming increasingly integrated to the extent that \"distributed\" computer networks are assuming key roles in communications. The complex computerized systems necessary to support modern military command and control requirements are expensive. Designing such systems \"by trial and error is not feasible, yet no other viable alternatives exist. This thesis offers an original methodology for...
Topics: Computer science, simulation, petri-net, evaluation
With the introduction of formal specification of abstracted computer resources, both physical and logical, there is the possibility that a major step forward can be made toward developing a methodology for reducing the portability and reusability costs of computing system components. Still, the current methodology is only concerned with the static functional properties of resources and not their timing properties. This places limitations on the generality of the method. This study describes a...
Topics: Computer science, formal specification, Petri net, abstraction of computer resources, timing of...
This thesis investigates the feasibility of software safety analysis using Petri net modeling and an automated suite of Petri Net UTilities (P-NUT) developed at UC Irvine. We briefly introduce software safety concepts, Petri nets, reachability theory, and the use of P-NUT. We then develop a methodology to combine these ideas for efficient and effective preliminary safety analysis of a real-time, embedded software, military system.
Topics: Petri nets, software safety, missile fuze, safety arming device, Petri net utilities, P-NUT
From the bitsavers.org collection, a scanned-in computer-related document. mit :: lcs :: tr :: MIT-LCS-TR-094
Topics: petri, net, deadlock, transition, marking, subnet, theorem, nets, firing, transitions, free choice,...
130
130
Jul 20, 2015
07/15
by
Dadmehr Rahbari
texts
eye 130
favorite 0
comment 0
Control of traffic lights at the intersections of the main issues is the optimal traffic. Intersections to regulate traffic flow of vehicles and eliminate conflicting traffic flows are used. Modeling and simulation of traffic are widely used in industry. In fact, the modeling and simulation of an industrial system is studied before creating economically and when it is affordable. The aim of this article is a smart way to control traffic. The first stage of the project with the objective of...
Topics: urban traffic, petri net, genetic algorithm, ijorcs, ijorcs.org
From the bitsavers.org collection, a scanned-in computer-related document. mit :: lcs :: tr :: MIT-LCS-TR-120
Topics: petri, net, transition, figure, computation, nets, firing, marking, timed, smd, petri net, petri...
190
190
Sep 28, 2012
09/12
by
Zhang Hui
texts
eye 190
favorite 0
comment 0
Dynamics and granularity in data mining grid scheduling (DMGS) are greatly influenced by resources. DMGS is defined as a workflow, combined with colored-hierarchy Petri Nets (CHPN) structure of the scheduling variable scheduling algorithm, which contains the scheduling problem into job scheduling layer, sub-job scheduling layer, task scheduling layer and sub-task scheduling layer. Within the four layers, job scheduling will be decomposed from top to bottom. Each layer is based on Petri net...
Topics: Colored-hierarchy, Petri Net, Data Mining Grid
From the bitsavers.org collection, a scanned-in computer-related document. mit :: lcs :: tr :: MIT-LCS-TR-159
Topics: petri, net, languages, firing, nets, labelled, transitions, figure, language, marking, petri net,...
75
75
texts
eye 75
favorite 0
comment 0
In this paper, we present a new way to simulate Turing machines using a specific form of Petri nets such that the resulting nets are capable of thoroughly describing behavior of the input Turing machines. We model every element of a Turing machine’s tuple (i.e., Q, Γ, b, Σ, δ, q0, F) with an equivalent translation in Colored Petri net’s set of elements with priority transitions such that the resulting translation (is a Petri net that) accepts the same language as the original Turing...
Topics: Turing machine, Colored Petri net, simulate, priority transition, time Complexity
From the bitsavers.org collection, a scanned-in computer-related document. mit :: lcs :: tr :: MIT-LCS-TR-161
Topics: petri, net, marking, firing, reachability, transition, nets, theorem, sequence, coverability, petri...
From the bitsavers.org collection, a scanned-in computer-related document. mit :: lcs :: tr :: MIT-LCS-TR-240
Topics: arc, graph, data, flow, acknowledge, input, arcs, output, token, figure, data flow, flow graph,...
The Entity-Relationship approach is investigated to determine its suitability for the construction of a logical database design for a tactical data system (TDS) to be used by surface ships in the U.S. Navy. Some motivation for the use of database techniques in the design of a TDS is given, and a conceptual schema design baaed on the Entity-Relationship approach is presented. This design includes Entity- Relationship diagrams in some detail for major entity and relationship sets for a TDS. An...
Topics: Computer science, entity-relationship model, tactical data system (TDS), naval tactical data system...
From the bitsavers.org collection, a scanned-in computer-related document. mit :: lcs :: tr :: MIT-LCS-TR-170
Topics: event, simulation, theorem, system, graph, tht, path, figure, petri, net, event graph, control...
5
5.0
Mar 18, 2021
03/21
by
Z. Aspar, Nasir Shaikh-Husin, M. Khalil-Hani
texts
eye 5
favorite 0
comment 0
Signal Interpreted Petri Nets (SIPN) modeling has been proposed as an alternative to Ladder Logic Diagram (LLD) modeling for programming complex programmable logic controllers (PLCs) due to its high level of abstraction and functionalities. This paper proposes an algorithm to efficiently convert existing SIPN models to their LLD models equivalences. In order to automate and speed up the conversion process, matrix calculation approach is used. A complex SIPN model was used to show that existing...
Topics: Conversion, Ladder Logic Diagram, Petri Net, Programmable Logic Controller
