Two process-algebraic approaches have been developed for comparing two bisimulation-equivalent processes with respect to speed: the one of Moller-Tofts equips actions with lower time bounds, while the other by Lüttgen-Vogler considers upper time bounds instead. This paper sheds new light onto both approaches by testifying to their close relationship and brings the research into bisimulation-based faster-than preorders to a close. We introduce a general, very intuitive concept of "faster-than", which is formalised by a notion of amortised faster-than preorder. When closing this preorder under all contexts, exactly the two faster-than preorders investigated by Moller/Tofts and Lüttgen/Vogler arise. For processes incorporating both lower and u...
AbstractA new bisimulation based semantics, called performance equivalence, is proposed for a proces...
We propose a variant of the version of branching bisimilation equivalence for processes with discret...
Semantic equivalences are used in process algebra to capture the notion of similar behaviour, and th...
AbstractTwo process-algebraic approaches have been developed for comparing two bisimulation-equivale...
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are...
More than a decade ago, Moller and Tofts published their seminal work on relating processes, which ...
This paper introduces a novel (bi)simulation-based faster-than preorder which relates asynchronous p...
AbstractThis paper introduces a novel (bi)simulation-based faster-than preorder which relates asynch...
TACS is an extension of CCS where upper time bounds for delays can be specified. Luettgen and Vogler...
TACS is an extension of CCS where upper time bounds for delays can be specified. Lüttgen and Vogler ...
Abstract. Why is deciding simulation preorder (and simulation equivalence) computationally harder th...
ed Bisimulation: Implicit Specifications and Decidability Kim G. Larsen y and Yi Wang z January...
AbstractThere have been quite a few proposals for behavioural equivalences for concurrent processes,...
This paper gives an overview of the computational complexity of all the equivalences in the linear/b...
AbstractBisimulation expresses the equivalence of processes whose external actions are identical. So...
AbstractA new bisimulation based semantics, called performance equivalence, is proposed for a proces...
We propose a variant of the version of branching bisimilation equivalence for processes with discret...
Semantic equivalences are used in process algebra to capture the notion of similar behaviour, and th...
AbstractTwo process-algebraic approaches have been developed for comparing two bisimulation-equivale...
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are...
More than a decade ago, Moller and Tofts published their seminal work on relating processes, which ...
This paper introduces a novel (bi)simulation-based faster-than preorder which relates asynchronous p...
AbstractThis paper introduces a novel (bi)simulation-based faster-than preorder which relates asynch...
TACS is an extension of CCS where upper time bounds for delays can be specified. Luettgen and Vogler...
TACS is an extension of CCS where upper time bounds for delays can be specified. Lüttgen and Vogler ...
Abstract. Why is deciding simulation preorder (and simulation equivalence) computationally harder th...
ed Bisimulation: Implicit Specifications and Decidability Kim G. Larsen y and Yi Wang z January...
AbstractThere have been quite a few proposals for behavioural equivalences for concurrent processes,...
This paper gives an overview of the computational complexity of all the equivalences in the linear/b...
AbstractBisimulation expresses the equivalence of processes whose external actions are identical. So...
AbstractA new bisimulation based semantics, called performance equivalence, is proposed for a proces...
We propose a variant of the version of branching bisimilation equivalence for processes with discret...
Semantic equivalences are used in process algebra to capture the notion of similar behaviour, and th...