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 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://lmcs.episciences.org/6047/pdf |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|