Journal ArticleDOI
Performance evaluation of concurrent systems using Petri nets
TLDR
Il existe deux approches du temps de modelisation des operations, la premiere methode associe le temps aux transitions tandis que la seconde associes le Temps au lieu.About:
This article is published in Information Processing Letters.The article was published on 1984-01-20. It has received 106 citations till now. The article focuses on the topics: Petri net.read more
Citations
More filters
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Journal ArticleDOI
Modeling, analysis, simulation, scheduling, and control of semiconductor manufacturing systems: A Petri net approach
TL;DR: A formal approach such as Petri nets enables one to describe such complex discrete event systems precisely and thus allows one to perform both qualitative and quantitative analysis, scheduling and discrete-event control of them.
Journal ArticleDOI
Faster maximum and minimum mean cycle algorithms for system-performance analysis
Ali Dasdan,Rajesh Gupta +1 more
TL;DR: This paper shows that Karp's algorithm processes more nodes and arcs than needed to find the maximum cycle mean of a digraph, and proposes a new graph-unfolding scheme that remedies this deficiency and leads to two faster algorithms with different characteristics.
Book
A Designer's Guide to Asynchronous VLSI
TL;DR: In this article, the authors present a practical guide to asynchronous design with a focus on practical techniques and real-world applications, as well as a large variety of design styles, while the emphasis throughout is on practical technique and real world applications.
Journal ArticleDOI
Time, Petri nets, and robotics
TL;DR: A unified description of the important temporal extensions of PN theory is presented and it is demonstrated that, for nets in Omega, the period of repetition can be directly computed from the durations associated with the individual operations, once the decomposition into components is performed.
References
More filters
Reducibility Among Combinatorial Problems.
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
Book
Performance evaluation of asynchronous concurrent systems using Petri nets
C. V. Ramamoorthy,G. S. Ho +1 more
TL;DR: An extended timed Petri net model is used to model clearly the synchronization involved in these systems, and it is found that the computational complexity involved increases in the same order as they are listed above.
Journal ArticleDOI
Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
C. V. Ramamoorthy,G. S. Ho +1 more
TL;DR: In this article, an extended timed Petri net model is used to model the synchronization involved in real-time asynchronous concurrent systems, and procedures for predicting and verifying the system performance are presented.