A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming

DOI10.1016/0020-0190(92)90158-RMaRDI QIDQ1197993zbMATH OpenOpenAlexFDO

Authors Javier Esparza

Publication date 16 January 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(92)90158-r

zbMATH Keywords

linear programmingconcurrencycovering problem1-bounded conflict-free Petri nets

Mathematics Subject Classification ID

Linear programming (90C05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Linear time analysis of properties of conflict-free and general Petri nets
• Integer linear programming and the analysis of some Petri net problems
• Deciding a class of path formulas for conflict-free Petri nets
• Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets
• Complexity results for problems of communication-free Petri nets and related formalisms

Cites work

• scientific article; zbMATH DE number 4096790 (Why is no real title available?)
• scientific article; zbMATH DE number 4096792 (Why is no real title available?)
• A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
• An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
• Properties of Conflict-Free and Persistent Petri Nets

Cited in

(2)

• Deciding a class of path formulas for conflict-free Petri nets
• Linear time analysis of properties of conflict-free and general Petri nets

This page was built for publication: A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming

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