Polynomial algorithms for the synthesis of bounded nets (Q5096743): Difference between revisions

@@ 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.1007/3-540-59293-8_207
+Normal rank
@@ Property / OpenAlex ID @@
+W1833736042
@@ Property / OpenAlex ID: W1833736042 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5615282
@@ Property / cites work: Q5615282 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281514
@@ Property / cites work: Q4281514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4431388
@@ Property / cites work: Q4431388 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288284
@@ Property / cites work: Q4288284 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial (set) 2-structures. I: Basic notions and the representation problems
+Normal rank
@@ Property / cites work @@
+Some complexity results on transition systems and elementary net systems
+Normal rank
@@ Property / cites work @@
+A trace semantics for Petri Nets
@@ Property / cites work: A trace semantics for Petri Nets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank