5 results
Rob van Glabbeek ; Bas Luttik ; Nikola Trcka.
We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL-X). This relation is obtained by De Nicola & Vaandrager by translating labelled transition systems to Kripke structures, while […]
Published on December 22, 2009
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
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
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
Jos C. M. Baeten ; Cesare Carissimo ; Bas Luttik.
The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reactive Turing Machine, transitions have labels to […]
Published on March 2, 2023