The $\pi$-Calculus is Behaviourally Complete and Orbit-Finitely Executable
Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour (finitely) executable if, and only if, it is equivalent to the behaviour of a (finite) reactive Turing machine. In this paper, we study the relationship between ex...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Logical Methods in Computer Science e.V.
2021-02-01
|
| Серии: | Logical Methods in Computer Science |
| Предметы: | |
| Online-ссылка: | https://lmcs.episciences.org/6047/pdf |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|