Search

• < Previous
• 1
• Next >

---

A symmetric protocol to establish service level agreements

Jan Friso Groote ; Tim A. C. Willemse.

We present a symmetrical protocol to repeatedly negotiate a desired service level between two parties, where the service levels are taken from some totally ordered finite domain. The agreed service level is selected from levels dynamically proposed by both parties and parties can only decrease the&nbsp;[&hellip;]

---

Correct and Efficient Antichain Algorithms for Refinement Checking

Maurice Laveaux ; Jan Friso Groote ; Tim A. C. Willemse.

The notion of refinement plays an important role in software engineering. It is the basis of a stepwise development methodology in which the correctness of a system can be established by proving, or computing, that a system refines its specification. Wang et al. describe algorithms based on&nbsp;[&hellip;]

---

Lowerbounds for Bisimulation by Partition Refinement

Jan Friso Groote ; Jan Martens ; Erik. P. de Vink.

We provide time lower bounds for sequential and parallel algorithms deciding bisimulation on labeled transition systems that use partition refinement. For sequential algorithms this is $\Omega((m \mkern1mu {+} \mkern1mu n ) \mkern-1mu \log \mkern-1mu n)$ and for parallel algorithms this is&nbsp;[&hellip;]

---