An incompleteness result in process algebra (Q1113665)
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 incompleteness result in process algebra |
scientific article; zbMATH DE number 4080899
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An incompleteness result in process algebra |
scientific article; zbMATH DE number 4080899 |
Statements
An incompleteness result in process algebra (English)
0 references
1988
0 references
By direct reduction to the equivalence problem for Turing machines it is verified that it is undecidable whether two communicating processes are equivalent. This problem is not even partially decidable, that is not recursively enumerable.
0 references
process algebra
0 references
observational equivalence
0 references
concurrency
0 references
incompleteness
0 references
equivalence problem for Turing machines
0 references
communicating processes
0 references
