Bisimulation and effectiveness (Q1118393)
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: Bisimulation and effectiveness |
scientific article; zbMATH DE number 4094790
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bisimulation and effectiveness |
scientific article; zbMATH DE number 4094790 |
Statements
Bisimulation and effectiveness (English)
0 references
1989
0 references
The author shows that the quotient of an algorithmic transition system by its greatest bisimulation equivalence is usually not algorithmic (reducibility to the halting problem). For the relevance of the notion of bisimulation see \textit{R. Milner}, Communication and concurrency, Prentice Hall International Series in Computer Science, New York, London, Toronto, Sydney, Tokyo (1989).
0 references
bisimulation
0 references
halting problem
0 references
