Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

On the Axiomatizability of Impossible Futures

Taolue Chen ; Wan Fokkink ; Rob van Glabbeek.
A general method is established to derive a ground-complete axiomatization for a weak semantics from such an axiomatization for its concrete counterpart, in the context of the process algebra BCCS. This transformation moreover preserves omega-completeness. It is applicable to semantics at least as&nbsp;[&hellip;]
Published on September 22, 2015

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.
Published on August 28, 2020

  • < Previous
  • 1
  • Next >