Model checking using net unfoldings (Q5044767): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-56610-4_93
+Normal rank
@@ Property / OpenAlex ID @@
+W1834539615
@@ Property / OpenAlex ID: W1834539615 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4202931
@@ Property / cites work: Q4202931 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040147
@@ Property / cites work: Q4040147 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching processes of Petri nets
@@ Property / cites work: Branching processes of Petri nets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3823147
@@ Property / cites work: Q3823147 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5604443
@@ Property / cites work: Q5604443 / rank @@
+Normal rank
@@ Property / cites work @@
+Petri nets, event structures and domains. I
@@ Property / cites work: Petri nets, event structures and domains. I / rank @@
+Normal rank
@@ Property / cites work @@
+Q3823149
@@ Property / cites work: Q3823149 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
+Normal rank