BIRS Workshop Lecture Videos
Asynchrony and Least Fixpoint Logic Reiter, Fabian
The goal of this talk is to raise interest in the connections between distributed computing and formal logic. I will illustrate this relatively unexplored area of research by presenting an equivalence result between two very specific systems. The distributed computing side will be represented by a notion of asynchronous distributed automaton with finite memory, while the formal logic side will be represented by a small fragment of least fixpoint logic (more specifically, a fragment of the modal mu-calculus).
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International