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

DOI10.1016/0020-0190(92)90158-RzbMath0780.68095OpenAlexW2077874425MaRDI QIDQ1197993

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)

Related Items (1)

Deciding a class of path formulas for conflict-free Petri nets

Cites Work

• 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
• Unnamed Item
• Unnamed Item

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