作者: Stephan Mennicke , Tobias Prehn
DOI: 10.1016/J.JLAMP.2019.01.004
关键词: Filter system 、 Correctness 、 Theoretical computer science 、 Correctness proofs 、 Computer science 、 Equivalence (formal languages)
摘要: Abstract Fairness assumptions are commonly used to filter system behaviors, thereby distinguishing between realistic and unrealistic executions. This allows for key arguments in correctness proofs of distributed systems, which would not be possible otherwise. Our first contribution is an equivalence spectrum fairness preserved. Although the identified equivalences allow reasoning about incorporating assumptions, this does necessarily lifting from sequential processes parallel compositions employing arbitrary synchronization mechanisms. second is, therefore, analysis composition operators their mechanisms respect.