TY - JOUR AU - Hildebrandt, Thomas Troels PY - 1999/01/28 Y2 - 2024/03/28 TI - A Fully Abstract Presheaf Semantics of SCCS with Finite Delay JF - BRICS Report Series JA - BRICS VL - 6 IS - 28 SE - Articles DO - 10.7146/brics.v6i28.20097 UR - https://tidsskrift.dk/brics/article/view/20097 SP - AB - We present a presheaf model for the observation of infinite as well<br />as finite computations. We apply it to give a denotational semantics of<br />SCCS with finite delay, in which the meanings of recursion are given by<br />final coalgebras and meanings of finite delay by initial algebras of the<br />process equations for delay. This can be viewed as a first step in representing<br />fairness in presheaf semantics. We give a concrete representation<br />of the presheaf model as a category of generalised synchronisation<br />trees and show that it is coreflective in a category of generalised transition<br />systems, which are a special case of the general transition systems<br />of Hennessy and Stirling. The open map bisimulation is shown to coincide<br />with the extended bisimulation of Hennessy and Stirling. Finally<br />we formulate Milners operational semantics of SCCS with finite delay<br />in terms of generalised transition systems and prove that the presheaf<br />semantics is fully abstract with respect to extended bisimulation. ER -