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

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-63165-8_211
+Normal rank
@@ Property / OpenAlex ID @@
+W1574761428
@@ Property / OpenAlex ID: W1574761428 / rank @@
+Normal rank
@@ Property / cites work @@
+Verifying programs with unreliable channels
@@ Property / cites work: Verifying programs with unreliable channels / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763590
@@ Property / cites work: Q4763590 / 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 @@
+Q4809151
@@ Property / cites work: Q4809151 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability analysis of pushdown automata: Application to model-checking
+Normal rank
@@ Property / cites work @@
+Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
+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 @@
+On Context-Free Languages
@@ Property / cites work: On Context-Free Languages / rank @@
+Normal rank