Promptness and bounded fairness in concurrent and parameterized systems

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

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

Publication date: 5 August 2020

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

Mathematics Subject Classification ID

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

Cited In (1)

• Guaranteeing Fair Service to Persistent Dependent Tasks

   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 👍 👎

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)