Proof rules and transformations dealing with fairness
From MaRDI portal
Publication:1050109
DOI10.1016/0167-6423(83)90004-7zbMath0512.68014OpenAlexW2149325295MaRDI QIDQ1050109
Krzysztof R. Apt, Ernst-Ruediger Olderog
Publication date: 1983
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/10274
Related Items
A category-theoretic semantics for unbounded indeterminacy, A complete rule for equifair termination, An algebraic theory of fair asynchronous communicating processes, An introduction to the regular theory of fairness, Deadlock and fairness in morphisms of transition systems, Infinite trees, markings, and well-foundedness, Appraising fairness in languages for distributed programming, Interpretations of recursion under unbounded nondeterminacy, m-Algebraic lattices in formal concept analysis, Liminf progress measures, Towards Modelling Obligations in Event-B, On the logic of UNITY, Strong fairness and ultra metrics, Complete proof rules for strong fairness and strong extreme fairness, The expressive power of indeterminate dataflow primitives, On equivalence-completions of fairness assumptions, Communicating processes, scheduling, and the complexity of nontermination, Explicit Fair Scheduling for Dynamic Control, Verification of concurrent programs: The automata-theoretic framework, Fifty years of Hoare's logic, Fairness and hyperfairness in multi-party interactions, Weak and strong fairness in CCS, Storage requirements for fair scheduling, A fair calculus of communicating systems, Fair termination revisited - with delay, Ten years of Hoare's logic: A survey. II: Nondeterminism, Nonexpressibility of fairness and signaling, A taxonomy of fairness and temporal logic problems for Petri nets
