Explicit Fair Scheduling for Dynamic Control (Q5187822): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-11512-7_7
+Normal rank
@@ Property / OpenAlex ID @@
+W1597625444
@@ Property / OpenAlex ID: W1597625444 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof rules and transformations dealing with fairness
+Normal rank
@@ Property / cites work @@
+Q4344071
@@ Property / cites work: Q4344071 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4331844
@@ Property / cites work: Q4331844 / rank @@
+Normal rank
@@ Property / cites work @@
+Static Analysis
@@ Property / cites work: Static Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Guarded commands, nondeterminacy and formal derivation of programs
+Normal rank
@@ Property / cites work @@
+A proof rule for fair termination of guarded commands
+Normal rank
@@ Property / cites work @@
+Q3922147
@@ Property / cites work: Q3922147 / rank @@
+Normal rank
@@ Property / cites work @@
+Verification: Theory and Practice
@@ Property / cites work: Verification: Theory and Practice / rank @@
+Normal rank
@@ Property / cites work @@
+Q2771052
@@ Property / cites work: Q2771052 / rank @@
+Normal rank
@@ Property / cites work @@
+Tools and Algorithms for the Construction and Analysis of Systems
+Normal rank
@@ Property / cites work @@
+Transition Invariants and Transition Predicate Abstraction for Program Termination
+Normal rank
@@ Property / cites work @@
+Transition predicate abstraction and fair termination
+Normal rank