Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q1960526): Difference between revisions

@@ Property / cites work @@
+Verifying programs with unreliable channels
@@ Property / cites work: Verifying programs with unreliable channels / rank @@
+Normal rank
@@ Property / cites work @@
+The algorithmic analysis of hybrid systems
@@ Property / cites work: The algorithmic analysis of hybrid systems / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of timed automata
@@ Property / cites work: A theory of timed automata / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability analysis of pushdown automata: Application to model-checking
+Normal rank
@@ Property / cites work @@
+On Communicating Finite-State Machines
@@ Property / cites work: On Communicating Finite-State Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q4222871
@@ Property / cites work: Q4222871 / rank @@
+Normal rank
@@ Property / cites work @@
+Unreliable channels are easier to verify than perfect channels
+Normal rank
@@ Property / cites work @@
+Q4223067
@@ Property / cites work: Q4223067 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for unboundedness of fifo channels
@@ Property / cites work: Testing for unboundedness of fifo channels / rank @@
+Normal rank