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...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Logical Methods in Computer Science e.V.
2021-02-01
|
| Collection: | Logical Methods in Computer Science |
| Sujets: | |
| Accès en ligne: | https://lmcs.episciences.org/6047/pdf |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|