A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611): Difference between revisions

The paper illustrates a polynomial time algorithm for which it is shown that the open \textit{M. Tiusanen's} [Bull. EATCS 36, 152-160 (1988; Zbl 0669.68046)] of determining whether two transitions in a 1-bounded conflict-free Petri net can become enabled simultaneously, is solvable in polynomial time.

0 references

zbMATH Keywords

concurrency

0 references

conflict-free Petri net

0 references

reviewed by

Thomas Mikosch

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0020-0190(91)90225-7

0 references

cites work

A decidability theorem for a class of vector-addition systems

0 references

Completeness results for conflict-free vector replacement systems

0 references

Q3823147

0 references

An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems

0 references

Complexity of some problems in Petri nets

0 references

Properties of Conflict-Free and Persistent Petri Nets

0 references

The covering and boundedness problems for vector addition systems

0 references

Q3823149

0 references

Identifiers

zbMATH Open document ID

0733.68060

0 references

DOI

10.1016/0020-0190(91)90225-7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:809611

@@ Property / reviewed by @@
+Thomas Mikosch
@@ Property / reviewed by: Thomas Mikosch / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(91)90225-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1993706145
@@ Property / OpenAlex ID: W1993706145 / rank @@
+Normal rank
@@ Property / cites work @@
+A decidability theorem for a class of vector-addition systems
+Normal rank
@@ Property / cites work @@
+Completeness results for conflict-free vector replacement systems
+Normal rank
@@ Property / cites work @@
+Q3823147
@@ Property / cites work: Q3823147 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
+Normal rank
@@ Property / cites work @@
+Complexity of some problems in Petri nets
@@ Property / cites work: Complexity of some problems in Petri nets / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of Conflict-Free and Persistent Petri Nets
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank
@@ Property / cites work @@
+Q3823149
@@ Property / cites work: Q3823149 / rank @@
+Normal rank