Promptness and bounded fairness in concurrent and parameterized systems

DOI10.1007/978-3-030-39322-9_16OpenAlexW3003923933MaRDI QIDQ784148FDOQ784148

Authors: Swen Jacobs, Mouhammad Sakr, Martín G. Zimmermann 

Publication date: 5 August 2020

Full work available at URL: https://arxiv.org/abs/1911.03122

Recommendations

• Fair termination for parameterized probabilistic concurrent systems
• Defining fairness in reactive and concurrent systems
• Concurrency, σ-Algebras, and Probabilistic Fairness
• Encoding fairness in a synchronous concurrent program algebra
• Relating fairness and timing in process algebras.
• A fixpoint approach to finite delay and fairness
• Fair synthesis for asynchronous distributed systems
• A program logic for concurrent objects under fair scheduling

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (1)

• Guaranteeing Fair Service to Persistent Dependent Tasks

This page was built for publication: Promptness and bounded fairness in concurrent and parameterized systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q784148)