Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355): Difference between revisions

@@ Property / cites work @@
+Undecidable verification problems for programs with unreliable channels
+Normal rank
@@ Property / cites work @@
+Q4138073
@@ Property / cites work: Q4138073 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebra of communicating processes with abstraction
+Normal rank
@@ Property / cites work @@
+On Communicating Finite-State Machines
@@ Property / cites work: On Communicating Finite-State Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q2757803
@@ Property / cites work: Q2757803 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding properties of integral relational automata
+Normal rank
@@ Property / cites work @@
+Reduction and covering of infinite reachability trees
+Normal rank
@@ Property / cites work @@
+Hybrid automata with finite bisimulations
@@ Property / cites work: Hybrid automata with finite bisimulations / rank @@
+Normal rank
@@ Property / cites work @@
+Ordering by Divisibility in Abstract Algebras
@@ Property / cites work: Ordering by Divisibility in Abstract Algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of a temporal logic problem for Petri nets
+Normal rank
@@ Property / cites work @@
+Parallel program schemata
@@ Property / cites work: Parallel program schemata / rank @@
+Normal rank
@@ Property / cites work @@
+Property preserving abstractions for the verification of concurrent systems
+Normal rank
@@ Property / cites work @@
+Analysis of a class of communicating finite state machines
+Normal rank