Analyzing Reachability for Some Petri Nets With Fast Growing Markings

DOI10.1016/j.entcs.2008.12.041zbMath1337.68190OpenAlexW1989252178MaRDI QIDQ4982096

Kamal Lodaya, M. Praveen

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.041

zbMATH Keywords

Petri netreachability problempartially bounded netT-invariant-less net

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Unnamed Item ⋮ Checking system boundedness using ordinary differential equations

Cites Work

• Complexity results for 1-safe nets
• Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm
• On the reachability problem for 5-dimensional vector addition systems
• Petri nets and regular languages
• A structure to decide reachability in Petri nets
• The covering and boundedness problems for vector addition systems
• Parallel program schemata
• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• Reachability analysis in T-invariant-less petri nets
• A Reachability Algorithm for General Petri Nets Based on Transition Invariants
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analyzing Reachability for Some Petri Nets With Fast Growing Markings