Robustness of a bisimulation-type faster-than preorder

@inproceedings{Iltgen2009RobustnessOA,
  title={Robustness of a bisimulation-type faster-than preorder},
  author={Katrin Iltgen and Walter Vogler},
  booktitle={EXPRESS},
  year={2009}
}
TACS is an extension of CCS where upper time bounds for delays can be specified. Luettgen and Vogler defined three variants of bismulation-type faster-than relations and showed that they all three lead to the same preorder, demonstrating the robustness of their approach. In the present paper, the operational semantics of TACS is extended; it is shown that two of the variants still give the same preorder as before, underlining robustness. An explanation is given why this result fails for the… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 12 REFERENCES

Amortised Bisimulations

This work conservatively extends CCS to include a new set of cost-based actions and defines a cost- based quantitative relation called amortised bisimulation, which allows for behavioural comparisons between nondeterministic systems that are inherently non-terminating and to analyse the relative long-term costs of deploying them.

Bisimulation on speed: worst-case efficiency

An efficiency preorder for processes

A simple efficiency preorder for CCS processes is introduced and is shown to be preserved by all CCS contexts except summation and it is used to analyse a non-trivial example: two different implementations of a bounded buffer.

Efficiency of asynchronous systems, read arcs, and the MUTEX-problem

  • W. Vogler
  • Computer Science
    Theor. Comput. Sci.
  • 2002

Liveness of a mutex algorithm in a fair process algebra

This work complements work by Walker and studies the liveness property of Dekker’s mutual exclusion algorithm within the process algebraic setting and presents some results that allow to reduce the state space of the PAFAS process representing Dekker's algorithm, and gives some insight into the representation of fair behaviour in PAfAS.

Communication and concurrency

  • R. Milner
  • Computer Science
    PHI Series in computer science
  • 1989
This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.

Performance of pipelined asynchronous systems

A Process Algebra for Timed Systems

A semantic theory based on testing is developed for the new language and is characterised in terms of barbs, a variety of ready traces and also characterised as the initial theory generated by a set of equations.

Distributed Algorithms

  • Seif Haridi
  • Computer Science
    Lecture Notes in Computer Science
  • 1992

Summarizing, we have given a number of new results that further support the robustness of the approach in [7] for comparing the worst-case efficiency of asynchronous processes

  • Summarizing, we have given a number of new results that further support the robustness of the approach in [7] for comparing the worst-case efficiency of asynchronous processes