Search

• < Previous
• 1
• Next >

---

Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy&#39;s Merge

Luca Aceto ; Wan Fokkink ; Anna Ingolfsdottir ; Bas Luttik.

This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion, relabelling and restriction free fragment of Milner's&nbsp;[&hellip;]

---

Equivalence checking for weak bi-Kleene algebra

Tobias Kappé ; Paul Brunet ; Bas Luttik ; Alexandra Silva ; Fabio Zanasi.

Pomset automata are an operational model of weak bi-Kleene algebra, which describes programs that can fork an execution into parallel threads, upon completion of which execution can join to resume as a single thread. We characterize a fragment of pomset automata that admits a decision procedure for&nbsp;[&hellip;]

---

The $\pi$-Calculus is Behaviourally Complete and Orbit-Finitely Executable

Bas Luttik ; Fei Yang.

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&nbsp;[&hellip;]

---