scispace - formally typeset
Search or ask a question
Topic

Petri net

About: Petri net is a research topic. Over the lifetime, 25039 publications have been published within this topic receiving 406994 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: An interval-inhibitor-arc-based robust deadlock control policy for a system with nonconvex legal reachability spaces by solving the maximal number of -critical marking/transition separation instances problems (MNTMPs)
Abstract: Resource failures may happen in automated manufacturing systems (AMSs) because of different reasons in the real world, making most existing deadlock control policies unapplicable. This paper develops methods for the robust deadlock control of AMSs with unreliable resources based on Petri nets. The considered AMSs are modeled with generalized systems of simple sequential processes with resources (GS3PR). First, a method based on reachability graph partition technique is provided to analyze the robust legal markings and the forbidden ones in an unreliable GS3PR (U-GS3PR), in which resource failures and recovery procedures are modeled with recovery subnets. Then, the control problem for such a system is converted into a problem for controlling the forbidden states in a U-GS3PR and control places can be designed by solving the maximal number of forbidden markings problems. Since the robust legal reachability spaces computed may be nonconvex and such a system cannot be optimally controlled by the conjunctions of linear constraints, we propose an interval-inhibitor-arc-based robust deadlock control policy for a system with nonconvex legal reachability spaces by solving the maximal number of ${t_{q}}$ -critical marking/transition separation instances problems (MNTMPs( ${t_{q}}$ )). Finally, examples are presented to demonstrate the proposed methods.

100 citations

BookDOI
01 Mar 2000
TL;DR: A summary of the state-of-the-art in the applications of Petri nets to designing digital systems and circuits is presented.
Abstract: From the Publisher: Presents a summary of the state-of-the-art in the applications of Petri nets to designing digital systems and circuits.

100 citations

Book ChapterDOI
05 Sep 1989
TL;DR: A systematic correspondence between Petri nets, linear logic theories, and linear categories is established, which sheds new light on the relationships between linear logic and concurrency, and on how both areas are related to category theory.
Abstract: Linear logic has been recently introduced by Girard as a logic of actions that seems well suited for concurrent computation. In this paper, we establish a systematic correspondence between Petri nets, linear logic theories, and linear categories. Such a correspondence sheds new light on the relationships between linear logic and concurrency, and on how both areas are related to category theory. Categories are here viewed as concurrent systems whose objects are states, and whose morphisms are transitions. This is an instance of the Lambek-Lawvere correspondence between logic and category theory that cannot be expressed within the more restricted framework of the Curry-Howard correspondence.

100 citations

Journal ArticleDOI
TL;DR: A unified methodology for modeling both soft and hard real-time systems is presented, using techniques that combine the effects of performance, reliability/availability, and deadline violation into a single model.
Abstract: A unified methodology for modeling both soft and hard real-time systems is presented. Techniques that combine the effects of performance, reliability/availability, and deadline violation into a single model are used. An online transaction processing system is used as an example to illustrate the modeling techniques. Dynamic failures due to a transaction violating a hard deadline are taken into account by incorporating additional transitions in the Markov chain model of the failure-repair behavior. System performance in the various configurations is considered by using throughput and response-time distribution as reward rates. Since the Markov chains used in computing the distribution of response time are often very large and complex, a higher level interface based on a variation of stochastic Petri nets called stochastic reward nets is used. >

100 citations

01 May 1999
TL;DR: This paper proposes the use of Colored Petri Nets as a model underlying a language for conversation interaction, carrying the relative sim- plicity and graphical representation of the former approach, along with greater expressive power and support for con- currency.
Abstract: Conversations are a useful means of structuring communica- tive interactions among agents. The value of a conversation- based approach is largely determined by the conversational model it uses. Finite State Machines, used heavily to date for this purpose, are not sucient for complex agent inter- actions requiring a notion of concurrency. We propose the use of Colored Petri Nets as a model underlying a language for conversation speci cation. This carries the relative sim- plicity and graphical representation of the former approach, along with greater expressive power and support for con- currency. The construction of such a language, Protolin- gua, is currently being investigated within the framework of the Jackal agent development environment. In this paper, we explore the use of Colored Petri Nets in modeling agent communicative interaction

99 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
85% related
Control system
129K papers, 1.5M citations
85% related
Server
79.5K papers, 1.4M citations
85% related
Fuzzy logic
151.2K papers, 2.3M citations
85% related
Robustness (computer science)
94.7K papers, 1.6M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023290
2022662
2021466
2020574
2019651
2018751