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

DOI10.1016/0020-0190(92)90158-RzbMATH Open0780.68095OpenAlexW2077874425MaRDI QIDQ1197993FDOQ1197993

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

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

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)

Cites Work

• Properties of Conflict-Free and Persistent Petri Nets
• An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free 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)