5 results
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 […]
Published on August 13, 2021
Rob van Glabbeek ; Bas Luttik ; Linda Spaninks.
We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of nil, action prefix, choice, and the recursion construct.
Published on August 28, 2020
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 […]
Published on February 10, 2021
Luca Aceto ; Valentina Castiglioni ; Anna Ingolfsdottir ; Bas Luttik ; Mathias R. Pedersen.
This paper studies the existence of finite equational axiomatisations of the interleaving parallel composition operator modulo the behavioural equivalences in van Glabbeek's linear time-branching time spectrum. In the setting of the process algebra BCCSP over a finite set of actions, we provide […]
Published on January 19, 2022
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 […]
Published on March 9, 2005