On Yen’s Path Logic for Petri Nets (Q3646251): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-04420-5_7
+Normal rank
@@ Property / OpenAlex ID @@
+W2177830523
@@ Property / OpenAlex ID: W2177830523 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954445
@@ Property / cites work: Q4954445 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4289279
@@ Property / cites work: Q4289279 / rank @@
+Normal rank
@@ Property / cites work @@
+Verifying liveness for asynchronous programs
@@ Property / cites work: Verifying liveness for asynchronous programs / rank @@
+Normal rank
@@ Property / cites work @@
+A structure to decide reachability in Petri nets
@@ Property / cites work: A structure to decide reachability in Petri nets / rank @@
+Normal rank
@@ Property / cites work @@
+Persistence of vector replacement systems is decidable
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank
@@ Property / cites work @@
+A unified approach for deciding the existence of certain petri net paths
+Normal rank
@@ Property / cites work @@
+A note on fine covers and iterable factors of VAS languages
+Normal rank
@@ Property / cites work @@
+On the regularity of Petri net languages
@@ Property / cites work: On the regularity of Petri net languages / rank @@
+Normal rank