Deciding properties of integral relational automata (Q4632414): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-58201-0_56
+Normal rank
@@ Property / OpenAlex ID @@
+W2146250272
@@ Property / OpenAlex ID: W2146250272 / 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 @@
+Undecidable verification problems for programs with unreliable channels
+Normal rank
@@ Property / cites work @@
+Q4038702
@@ Property / cites work: Q4038702 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036557
@@ Property / cites work: Q4036557 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic construction of test sets: Theoretical approach
+Normal rank
@@ Property / cites work @@
+Q4138073
@@ Property / cites work: Q4138073 / 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 @@
+Bisimulation equivalence is decidable for all context-free processes
+Normal rank
@@ Property / cites work @@
+Automatic verification of finite-state concurrent systems using temporal logic specifications
+Normal rank
@@ Property / cites work @@
+Q4954445
@@ Property / cites work: Q4954445 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942620
@@ Property / cites work: Q4942620 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the General Petri Net Reachability Problem
+Normal rank
@@ Property / cites work @@
+Q5590814
@@ Property / cites work: Q5590814 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3911403
@@ Property / cites work: Q3911403 / rank @@
+Normal rank
@@ Property / cites work @@
+The complementation problem for Büchi automata with applications to temporal logic
+Normal rank
@@ Property / cites work @@
+Automata-theoretic techniques for modal logics of programs
+Normal rank