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;]

---

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics

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

---