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...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Logical Methods in Computer Science e.V.
2021-02-01
|
| Edice: | Logical Methods in Computer Science |
| Témata: | |
| On-line přístup: | https://lmcs.episciences.org/6047/pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|