CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: COSY / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081455126 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1505.05964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Appraising fairness in languages for distributed programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete time process algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the consistency of Koomen's fair abstraction rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness of actions in system computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liveness of a mutex algorithm in a fair process algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Fairness in a Process Algebra with Non-blocking Reading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing the worst-case efficiency of asynchronous systems with PAFAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fair calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak and strong fairness in CCS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of A time‐shared processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapping mutual exclusion in the box calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Process Algebra for Wireless Mesh Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines, transition systems, and interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a unified approach to encodability and separation results for process calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A process algebra for timed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutex needs fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: COSY - a system specification language based on paths and processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3833630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of mobile processes. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nets, Terms and Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness of Process Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Myths about the mutual exclusion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Specifying Timeouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract processes of place/transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of asynchronous systems, read arcs, and the MUTEX-problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated analysis of mutual exclusion algorithms using CCS / rank
 
Normal rank

Latest revision as of 23:45, 9 July 2024

scientific article
Language Label Description Also known as
English
CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
scientific article

    Statements

    CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (English)
    0 references
    0 references
    0 references
    16 April 2015
    0 references
    distributed system
    0 references
    fair scheduler
    0 references
    fairness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers