An efficiency preorder for processes (Q1323358)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficiency preorder for processes |
scientific article; zbMATH DE number 567319
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficiency preorder for processes |
scientific article; zbMATH DE number 567319 |
Statements
An efficiency preorder for processes (English)
0 references
30 June 1994
0 references
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.
0 references
process algebra
0 references
communication
0 references
concurrency
0 references
prebisimulation
0 references
calculus
0 references
CCS
0 references
proof system for finite processes
0 references
