Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5894255): Difference between revisions

@@ Property / cites work @@
+Term Rewriting and All That
@@ Property / cites work: Term Rewriting and All That / rank @@
+Normal rank
@@ Property / cites work @@
+Q3774929
@@ Property / cites work: Q3774929 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebra of communicating processes with abstraction
+Normal rank
@@ Property / cites work @@
+CONCUR 2005 – Concurrency Theory
@@ Property / cites work: CONCUR 2005 – Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+On decidability of LTL model checking for process rewrite systems
+Normal rank
@@ Property / cites work @@
+Tree generating regular systems
@@ Property / cites work: Tree generating regular systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q2760246
@@ Property / cites work: Q2760246 / rank @@
+Normal rank
@@ Property / cites work @@
+Bottom-up tree pushdown automata: Classification and connection with rewrite systems
+Normal rank
@@ Property / cites work @@
+The regular viewpoint on PA-processes
@@ Property / cites work: The regular viewpoint on PA-processes / rank @@
+Normal rank
@@ Property / cites work @@
+Process rewrite systems.
@@ Property / cites work: Process rewrite systems. / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of model checking with the temporal logic EF
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+The theory of ends, pushdown automata, and second-order logic
+Normal rank
@@ Property / cites work @@
+Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
+Normal rank
@@ Property / cites work @@
+Branching time and abstraction in bisimulation semantics
+Normal rank