Search

• < Previous
• 1
• Next >

---

Characterising Testing Preorders for Finite Probabilistic Processes

Yuxin Deng ; Matthew Hennessy ; Rob van Glabbeek ; Carroll Morgan.

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years, namely to find complete axiomatisations and alternative&nbsp;[&hellip;]

---

Computation Tree Logic with Deadlock Detection

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

---

On Characterising Distributability

Rob J. van Glabbeek ; Ursula Goltz ; Jens-Wolfhard Schicke-Uffmann.

We formalise a general concept of distributed systems as sequential components interacting asynchronously. We define a corresponding class of Petri nets, called LSGA nets, and precisely characterise those system specifications which can be implemented as LSGA nets up to branching ST-bisimilarity&nbsp;[&hellip;]

---

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

---

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.

---

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

---