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...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Logical Methods in Computer Science e.V.
2021-02-01
|
| Serie: | Logical Methods in Computer Science |
| Soggetti: | |
| Accesso online: | https://lmcs.episciences.org/6047/pdf |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|