Reachability determination in acyclic Petri nets by cell enumeration approach

DOI10.1016/J.AUTOMATICA.2011.06.017zbMATH Open1225.68127OpenAlexW2054538707WikidataQ57445452 ScholiaQ57445452MaRDI QIDQ644287FDOQ644287

Authors: Xiaoling Sun, Shenshen Gu, Duan Li, J. J. Gao, X. J. Zheng 

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

Recommendations

• scientific article; zbMATH DE number 762060
• An Algorithm for the General Petri Net Reachability Problem
• Reachability in cyclic extended free-choice systems
• Structuring acyclic Petri nets for reachability analysis and control
• scientific article; zbMATH DE number 2112159

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reverse search for enumeration
• Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
• Towards strong duality in integer programming
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Recent advances in formal languages and applications.
• Title not available (Why is that?)
• The Linear Diophantine Equation
• State equation, controllability, and maximal matchings of petri nets
• Reachability analysis in T-invariant-less petri nets
• Algorithmic Number Theory

Cited In (5)

• Title not available (Why is that?)
• A sufficient condition for reachability in a general Petri net
• Mathematical programming approach to the Petri nets reachability problem
• Proof by model: a new knowledge-based reachability analysis methodology for Petri net
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: Reachability determination in acyclic Petri nets by cell enumeration approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644287)