An efficiency preorder for processes
type: Item
instance of: scholarly article
title: An efficiency preorder for processes
zbMATH Open document ID: 0790.68039
DOI: 10.1007/BF01191894
author: S. Arun-Kumar
author: Matthew Hennessy
published in: Acta Informatica
publication date: 1994-06-30T00:00:00Z
review text: A simple efficiency preorder for CCS processes is introduced in which \(p\preceq q\) means that \(q\) is at least as fast as \(p\), or more generally, \(p\) uses at least as much resources as \(q\). It is shown to be preserved by all CCS contexts except summation and it is used to analyse a non-trivial example: two different implementations of a bounded buffer. Finally, we give a sound and complete proof system for finite processes.
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 567319
zbMATH Keywords: process algebra
zbMATH Keywords: communication
zbMATH Keywords: concurrency
zbMATH Keywords: prebisimulation
zbMATH Keywords: calculus
zbMATH Keywords: CCS
zbMATH Keywords: proof system for finite processes
MaRDI profile type: Publication
cites work: Q3997501
cites work: Algebraic laws for nondeterminism and concurrency
cites work: A process algebra for timed systems
cites work: Q3777424
cites work: Calculi for synchrony and asynchrony
cites work: Q3992568
cites work: Q3725534
description: scientific article; zbMATH DE number 567319