Often fairness assumptions need to be made in order to establish liveness properties of distributed systems, but in many situations they lead to false conclusions.

This document presents a research agenda aiming at laying the foundations of a theory of concurrency that is equipped to ensure liveness properties of distributed systems without making fairness assumptions. This theory will encompass process algebra, temporal logic and semantic models. The agenda also includes the development of a methodology and tools that allow successful application of this theory to the specification, analysis and verification of realistic distributed systems.

Contemporary process algebras and temporal logics fail to make distinctions between systems of which one has a crucial liveness property and the other does not, at least when assuming justness, a strong progress property, but not assuming fairness. Setting up an alternative framework involves giving up on identifying strongly bisimilar systems, inventing new induction principles, developing new axiomatic bases for process algebras and new congruence formats for operational semantics, and creating matching treatments of time and probability.

Even simple systems like fair schedulers or mutual exclusion protocols cannot be accurately specified in standard process algebras (or Petri nets) in the absence of fairness assumptions. Hence the work involves the study of adequate language or model extensions, and their expressive power.

为了建立分布式系统的活动性，通常需要进行公平性假设，但是在许多情况下，它们会导致错误的结论。

本文档提出了一个研究议程，旨在奠定并发理论的基础，该理论可确保在不做出公平假设的情况下确保分布式系统的活跃性。该理论将涵盖过程代数，时间逻辑和语义模型。议程还包括开发一种方法和工具，以使该理论成功地应用于现实的分布式系统的规范，分析和验证。

当代的过程代数和时间逻辑无法区分系统，其中一个系统具有至关重要的活力属性，而另一个系统则至少在假定公正性，强大的进步属性但不假设公平性的情况下没有区别。建立替代框架包括放弃确定强烈的双相似系统，发明新的归纳原理，为过程代数开发新的公理基础，为操作语义开发新的全等格式以及创建时间和概率的匹配处理。

在没有公平性假设的情况下，即使是简单的系统（如公平调度程序或互斥协议）也无法在标准流程代数（或Petri网）中准确指定。因此，这项工作涉及对适当的语言或模型扩展及其表达能力的研究。