Reachability determination in acyclic Petri nets by cell enumeration approach

DOI10.1016/j.automatica.2011.06.017zbMath1225.68127OpenAlexW2054538707WikidataQ57445452 ScholiaQ57445452MaRDI QIDQ644287

Xiaoling Sun, Shenshen Gu, Xiao Jin Zheng, Jian-Jun Gao, Li, Duan

Publication date: 3 November 2011

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2011.06.017

zbMATH Keywords

Petri netsreachability analysiscell enumerationlinear Diophantine equations on bounded integer set

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Reverse search for enumeration
• Recent advances in formal languages and applications.
• Towards strong duality in integer programming
• Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
• The Linear Diophantine Equation
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• State equation, controllability, and maximal matchings of petri nets
• Reachability analysis in T-invariant-less petri nets
• Algorithmic Number Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item