Categorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite Delay

Categorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite Delay (1999)

by Thomas T. Hildebrandt

Venue:	CTCS’99, LNCS
Citations:	1 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Categorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite Delay	user correction - Legacy Corrections
AUTHOR NAME	Thomas T. Hildebrandt	SVM HeaderParse 0.1
AUTHOR AFFIL	The IT University of Copenhagen, Denmark,	SVM HeaderParse 0.2
ABSTRACT	We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. We give a concrete representation of the presheaf model as a category of generalised synchronisation trees and show that it is coreflective in a category of generalised transition systems, which are a special case of the general transition systems of Hennessy and Stirling. The open map bisimulation is shown to coincide with extended bisimulation of Hennessy and Stirling, which is essentially fair CTL*-bisimulation. Finally we formulate Milners operation semantics of SCCS with finite delay in terms of generalised transition systems and prove that the presheaf semantics is fully abstract with respect to extended bisimulation.	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	CTCS’99, LNCS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	32 found	ParsCit 1.0