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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Proof rules and transformations dealing with fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarded commands, nondeterminacy and formal derivation of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof rule for fair termination of guarded commands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification: Theory and Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2771052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition Invariants and Transition Predicate Abstraction for Program Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition predicate abstraction and fair termination / rank
 
Normal rank

Latest revision as of 13:27, 2 July 2024

scientific article; zbMATH DE number 5679031
Language Label Description Also known as
English
Explicit Fair Scheduling for Dynamic Control
scientific article; zbMATH DE number 5679031

    Statements