
doi: 10.1007/bfb0055763
Bisimulation is a rich concept which appears in various areas of theoretical computer science. Its origin lie in concurrency theory and in modal logic. In this paper we review results about bisimulation, from bothh the point of view of automata and from a logical point of view. We also consider how bisimulation has a role in finite model theory, and we offer a new undefinability result.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 21 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
