Two finite specifications of a queue
type: Item
instance of: scholarly article
title: Two finite specifications of a queue
zbMATH Open document ID: 0911.68010
DOI: 10.1016/S0304-3975(96)00257-5
author: Marc Bezem
author: Alban Ponse
published in: Theoretical Computer Science
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1178551
zbMATH Keywords: finite specifications of a queue in ACP
MaRDI profile type: Publication
cites work: Global renaming operators in concrete process algebra
cites work: Process Algebra
cites work: Q4525274
cites work: Algebra of communicating processes with abstraction
cites work: Q3028334
cites work: Q3776607
cites work: Formal verification of a leader election protocol in process algebra
cites work: Q4312484
cites work: Q3777424
cites work: Laws of programming
cites work: Q3992568
cites work: Computable processes and bisimulation equivalence
cites work: Branching time and abstraction in bisimulation semantics
description: scientific article; zbMATH DE number 1178551