Verifying identical communicating processes is undecidable (Q1269916)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Verifying identical communicating processes is undecidable |
scientific article |
Statements
Verifying identical communicating processes is undecidable (English)
0 references
22 October 1998
0 references
boundedness
0 references
reachability tree finiteness
0 references
