On decidability of LTL model checking for process rewrite systems (Q1006890): Difference between revisions

@@ Property / cites work @@
+Verification, Model Checking, and Abstract Interpretation
+Normal rank
@@ Property / cites work @@
+On Decidability of LTL Model Checking for Process Rewrite Systems
+Normal rank
@@ Property / cites work @@
+Q4954445
@@ Property / cites work: Q4954445 / rank @@
+Normal rank
@@ Property / cites work @@
+First-order logic with two variables and unary temporal logic
+Normal rank
@@ Property / cites work @@
+CONCUR 2004 - Concurrency Theory
@@ Property / cites work: CONCUR 2004 - Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q2847415
@@ Property / cites work: Q2847415 / rank @@
+Normal rank
@@ Property / cites work @@
+FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+An Algorithm for the General Petri Net Reachability Problem
+Normal rank
@@ Property / cites work @@
+Q4234763
@@ Property / cites work: Q4234763 / rank @@
+Normal rank
@@ Property / cites work @@
+Process rewrite systems.
@@ Property / cites work: Process rewrite systems. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5590814
@@ Property / cites work: Q5590814 / rank @@
+Normal rank