Search

• < Previous
• 1
• Next >

---

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

---

Failure Trace Semantics for a Process Algebra with Time-outs

Rob van Glabbeek.

This paper extends a standard process algebra with a time-out operator, thereby increasing its absolute expressiveness, while remaining within the realm of untimed process algebra, in the sense that the progress of time is not quantified. Trace and failures equivalence fail to be congruences for&nbsp;[&hellip;]

---