Abstract

The computational complexity of reachability problems for Petri nets is analyzed and a new class of Petri nets is introduced. A net of the class is composed of subnets of state machines. Sufficient conditions on initial and target markings are obtained under which the reachability problem for the class is solvable in deterministic polynomial time. Also presented is an algorithm that examines in deterministic polynomial time whether a Petri net is in the class. >

Full Text

Published Version
Open DOI Link

Topics from this Paper

  • Deterministic Polynomial Time
  • Class Of Petri Nets
  • Reachability Problems For Petri Nets
  • New Class Of Petri Nets
  • Deterministic Time
    • + Show 5 more

Create a personalized feed of these topics

Get Started

Get access to 115M+ research papers

Discover from 40M+ Open access, 2M+ Pre-prints, 9.5M Topics and 32K+ Journals.

Sign Up Now! It's FREE

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Modeling and analysis of manufacturing systems using a new class of Petri nets
  • Jul 6, 2004
Relevant
Not Relevant
Two theoretical and practical aspects of knitting technique: invariants and a new class of Petri net
  • IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
  • Dec 1, 1997
Relevant
Not Relevant
Petri nets with k simultaneously enabled generally distributed timed transitions
  • Performance Evaluation
  • Feb 1, 1998
Relevant
Not Relevant
Using Transition Invariants for Reachability Analysis of Petri Nets
  • Feb 1, 2008
Relevant
Not Relevant
Structuring Acyclic Petri Nets for Reachability Analysis and Control
  • Discrete Event Dynamic Systems
  • Jan 1, 2002
Relevant
Not Relevant
Coloured Petri net model of application specific logic controller programs
  • Jul 7, 1997
Relevant
Not Relevant
Petri transport networks
  • Journal of Physics: Conference Series
  • May 1, 2020
Relevant
Not Relevant
Higher-order Petri net models based on artificial neural networks
  • Artificial Intelligence
  • May 1, 1997
Relevant
Not Relevant
Composition Colored Petri Nets for the Refinement of Reaction-based Models
  • Electronic Notes in Theoretical Computer Science
  • Oct 28, 2016
Relevant
Not Relevant
Structurally Cyclic Petri Nets
  • Logical Methods in Computer Science
  • Oct 28, 2015
Relevant
Not Relevant
Reachability analysis for a class of Petri nets
  • Dec 1, 2009
Relevant
Not Relevant
Membrane Systems with Qualitative Evolution Rules
  • Fundamenta Informaticae
  • Jan 1, 2011
Relevant
Not Relevant
Modeling Internet Host Reliability using Higher-Order Time Petri Net
  • International Journal of Computer Applications
  • Dec 18, 2013
Relevant
Not Relevant
Concurrency bugs in multithreaded software: modeling and analysis using Petri nets
  • Discrete Event Dynamic Systems
  • May 13, 2012
Relevant
Not Relevant
Parameterized Petri nets and their application to planning and coordination in intelligent systems
  • IEEE Transactions on Systems, Man, and Cybernetics
  • Oct 1, 1994
Relevant
Not Relevant