skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: An Inclusive Study of Petri Nets and Their Applications
The main purpose of this report is to provide information on Petri nets, including their, design, semantics, properties, and uses. The problem addressed is how to model and analyze systems that may be susceptible to unknown issues. By visualizing these issues, we can improve or modify the system. Petri nets are highly powerful tools that can solve several problems, including issues with workflow management, deadlock, data transmission in communication systems, manufacturing and production, software systems, and more. These things are widely used in different work fields such as engineering, project management, and computer science. It is important to solve these problems for maintaining system reliability, and optimal performance. Exploring all the uses and techniques of a Petri net, beginning with the basics and advancing to the more complex ideas, demonstrates just how effective they are. The results confirm that Petri nets are important for identifying systems that need improvement within their performance and components across multiple fields.  more » « less
Award ID(s):
2229876
PAR ID:
10577380
Author(s) / Creator(s):
;
Publisher / Repository:
Norfolk State University College of Science, Engineering and Technology. Technical Report No.1.
Date Published:
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Lecture notes in computer science)
    null; null (Ed.)
    Generating the state space of any finite discrete-state system using symbolic algorithms like saturation requires the use of decision diagrams or compatible structures for encoding its reachability set and transition relations. For systems that can be formally expressed using ordinary Petri Nets(PN), implicit relations, a static alternative to decision diagram-based representation of transition relations, can significantly improve the performance of saturation. However, in practice, some systems require more general models, such as self-modifying Petri nets, which cannot currently utilize implicit relations and thus use decision diagrams that are repeatedly rebuilt to accommodate the changing bounds of the system variables, potentially leading to overhead in saturation algorithm. This work introduces a hybrid representation for transition relations, that combines decision diagrams and implicit relations, to reduce the rebuilding overheads of the saturation algorithm for a general class of models. Experiments on several benchmark models across different tools demonstrate the efficiency of this representation. 
    more » « less
  2. ; ; ; ; (, Proceedings of the AAAI Symposium Series)
    We argue for the use of Petri nets as a modeling language for the iterative development process of interactive robotic systems. Petri nets, particularly Timed Colored Petri nets (TCPNs), have the potential to unify various phases of the development process-design, specification, simulation, validation, implementation, and deployment. We additionally discuss future directions for creating a domain-specific variant of TCPNs tailored specifically for HRI systems development. 
    more » « less
  3. ; ; ; ; ; ; ; (, Instructional Science)
    Abstract We face complex global issues such as climate change that challenge our ability as humans to manage them. Models have been used as a pivotal science and engineering tool to investigate, represent, explain, and predict phenomena or solve problems that involve multi-faceted systems across many fields. To fully explain complex phenomena or solve problems using models requires both systems thinking (ST) and computational thinking (CT). This study proposes a theoretical framework that uses modeling as a way to integrate ST and CT. We developed a framework to guide the complex process of developing curriculum, learning tools, support strategies, and assessments for engaging learners in ST and CT in the context of modeling. The framework includes essential aspects of ST and CT based on selected literature, and illustrates how each modeling practice draws upon aspects of both ST and CT to support explaining phenomena and solving problems. We use computational models to show how these ST and CT aspects are manifested in modeling. 
    more » « less
  4. ; ; ; ; ; ; ; (, APS March Meeting 2022, abstract id.G38.001)
    One of the most fundamental problems that has no efficient solutions on classical computers is simulation of quantum systems. It has been long hypothesized that quantum computing devices are naturally more suitable for this task, but many aspects of practical implementations of such simulations remain unknown. One particularly important kind of these simulations is the simulation of molecular dynamics, i.e. prediction of time evolution for a system of interacting particles. In this work we show how a quantum annealer can be used to carry out such simulations by solving differential equations of motion, on the example of the hydrogen molecule. Although the considered system is simple, our method is well scalable and can be readily applied to more complicated systems as annealers with larger number of qubits become available. Importantly, the method is general and can be used to solve arbitrary systems of ordinary non-linear differential equations, which can be helpful not only in the field of computational chemistry, but in many other fields as well. 
    more » « less
  5. ; ; ; ; ; (, Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition)
    Systems of polynomial equations arise frequently in computer vision, especially in multiview geometry problems. Traditional methods for solving these systems typically aim to eliminate variables to reach a univariate polynomial, e.g., a tenth-order polynomial for 5-point pose estimation, using clever manipulations, or more generally using Grobner basis, resultants, and elimination templates, leading to successful algorithms for multiview geometry and other problems. However, these methods do not work when the problem is complex and when they do, they face efficiency and stability issues. Homotopy Continuation (HC) can solve more complex problems without the stability issues, and with guarantees of a global solution, but they are known to be slow. In this paper we show that HC can be parallelized on a GPU, showing significant speedups up to 56 times on polynomial benchmarks. We also show that GPU-HC can be generically applied to a range of computer vision problems, including 4-view triangulation and trifocal pose estimation with unknown focal length, which cannot be solved with elimination template but they can be efficiently solved with HC. GPU-HC opens the door to easy formulation and solution of a range of computer vision problems. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email