Search

• < Previous
• 1
• Next >

---

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

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.

---

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

---