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...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Logical Methods in Computer Science e.V.
2021-02-01
|
| Schriftenreihe: | Logical Methods in Computer Science |
| Schlagworte: | |
| Online-Zugang: | https://lmcs.episciences.org/6047/pdf |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|