Verifying identical communicating processes is undecidable (Q1269916)
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: Verifying identical communicating processes is undecidable |
scientific article; zbMATH DE number 1213165
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Verifying identical communicating processes is undecidable |
scientific article; zbMATH DE number 1213165 |
Statements
Verifying identical communicating processes is undecidable (English)
0 references
22 October 1998
0 references
boundedness
0 references
reachability tree finiteness
0 references
