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
Book ChapterDOI
TL;DR: Four case studies where coloured Petri Nets and their supporting computer tools have been used in system development projects with industrial partners are presented to illustrate different application areas of CP-nets in various phases of system development.
Abstract: Coloured Petri Nets (CP-nets or CPNs) and their supporting computer tools have been used in a wide range of application areas such as communication protocols, software designs, and embedded systems. The practical application of CP-nets has also covered many phases of system development ranging from requirements to design, validation, and implementation. This paper presents four case studies where CP-nets and their supporting computer tools have been used in system development projects with industrial partners. The case studies have been selected such that they illustrate different application areas of CP-nets in various phases of system development.

96 citations

Journal ArticleDOI
TL;DR: By using a hybrid Petri net to describe the behavior of crude oil operations, it is shown that a feasible schedule can be found for a system with two or more than two distillers if there are two charging tanks for each distiller, which is the least number of charging tanks to reach the maximal productivity.

96 citations

Proceedings ArticleDOI
02 May 1993
TL;DR: An approach to process modeling, task synthesis, and motion control for robotic assembly is presented, modeled as a discrete-event dynamic system using Petri nets and incorporating both discrete and continuous aspects of the process.
Abstract: An approach to process modeling, task synthesis, and motion control for robotic assembly is presented. Assembly is modeled as a discrete-event dynamic system using Petri nets and incorporating both discrete and continuous aspects of the process. To accomplish a desired trajectory, a discrete event controller is developed. The controller issues velocity commands that direct the system toward the next desired contact state, while maintaining currently desired contacts and avoiding unwanted transitions. Experimental results are given for a dual peg-in-the-hole example. The results not only demonstrate highly successful insertion along the optimal trajectory, but also demonstrate the ability to detect, recognize, and recover from errors and unwanted situations. >

95 citations

Journal ArticleDOI
TL;DR: The proposed models suggest a mathematical framework for the analysis and control design in urban and interurban networks and suitable to represent the traffic flow either from a macroscopic point of view where only global variables are observed or from a microscopic one where the individual trajectories of vehicles are discussed.

95 citations

Proceedings ArticleDOI
01 Jun 1999
TL;DR: A Quasi-Static Scheduling (QSS) algorithm that generates a schedule in which run-time decisions are made only for data-dependent control structures, and it is shown how to synthesize from a quasi-static schedule a C code implementation that consists of a set of concurrent tasks.
Abstract: Software synthesis from a concurrent functional specification is a key problem in the design of embedded systems. A concurrent specification is well-suited for medium-grained partitioning. However, in order to be implemented in software, concurrent tasks need to be scheduled on a shared resource (the processor). The choice of the scheduling policy mainly depends on the specification of the system. For pure dataflow specifications, it is possible to apply a fully static scheduling technique, while for algorithms containing data-dependent control structures, like the if-then-else or while-do constructs, the dynamic behaviour of the system cannot be completely predicted at compile time and some scheduling decisions are to be made at run-time. For such applications we propose a Quasi-Static Scheduling (QSS) algorithm that generates a schedule in which run-time decisions are made only for data-dependent control structures. We use Free Choice Petri Nets (FCPNs), as the underlying model, and define quasi-static schedulability for FCPNs. The proposed algorithm is complete, in that it can solve QSS for any FCPN that is quasi-statically schedulable. Finally, we show how to synthesize from a quasi-static schedule a C code implementation that consists of a set of concurrent tasks.

95 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