Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

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;]
Published on October 28, 2008

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;]
Published on April 23, 2021

  • < Previous
  • 1
  • Next >