Semantics for finite delay
type: Item
instance of: scholarly article
title: Semantics for finite delay
zbMATH Open document ID: 0903.68119
DOI: 10.1016/S0304-3975(96)00095-3
author: Chrysafis Hartonas
published in: Theoretical Computer Science
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1178869
zbMATH Keywords: fair bisimilarity
MaRDI profile type: Publication
cites work: Q3992552
cites work: Final universes of processes
cites work: A final coalgebra theorem
cites work: Terminal coalgebras in well-founded set theory
cites work: Q4075450
cites work: Q4717366
cites work: Testing equivalences for processes
cites work: Q3738540
cites work: Q4870814
cites work: A term model for synchronous processes
cites work: Axiomatising finite delay operators
cites work: Acceptance trees
cites work: An algebraic theory of fair asynchronous communicating processes
cites work: Q3997501
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Calculi for synchrony and asynchrony
cites work: Q3992568
cites work: Q3906397
cites work: Nonwellfounded sets and programming language semantics
cites work: A coinductive calculus of streams
cites work: On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
cites work: Synchronization trees
description: scientific article; zbMATH DE number 1178869