AbstractBased on the hypothesis of durational actions and process synchronization with “busy waiting” mechanism,performance equivalencehas been proposed to introduce a simple form of performance evaluation in process algebras. This equivalence enjoys many of the pleasant properties of those in the untimed setting but it is not a congruence for parallel composition with synchronization. In this paper we give a bisimulation-based characterization of the coarsest congruence contained within performance equivalence (and discuss alternative formulations). This problem was left open in several papers. We study how the new equivalence, calledperformance congruence, relates with other closed equivalences in the literature and show that, unlike othe...
AbstractThis paper introduces a novel (bi)simulation-based faster-than preorder which relates asynch...
Abstract. The paper introduces a new approach to define process algebras withquantified transitions....
Abstract ory of concurrency; the symbol; represents We present a simple process algebra which suppor...
AbstractA new bisimulation based semantics, called performance equivalence, is proposed for a proces...
AbstractThe modeling and analysis experience with process algebras has shown the necessity of extend...
The modeling and analysis experience with process algebras has shown the necessity of extending them...
We present a process algebra for the performance modeling and evaluation of concurrent systems whose...
Abstract. We present a process algebra for the performance modeling and evaluation of concurrent sys...
AbstractGlobal-clock-bounded equivalence has been proposed in the literature as a performance-sensit...
AbstractThis paper surveys the theoretical developments in the field of stochastic process algebras,...
AbstractMore than 15 years ago, Cleaveland and Hennessy proposed an extension of the process algebra...
This paper surveys the theoretical developments in the field of stochastic process algebras, process...
AbstractWe present a simple process algebra which supports a form of refinement of an action by a pr...
AbstractAn operational semantics for an algebraic theory of concurrency that incorporates a notion o...
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...
Abstract. The paper introduces a new approach to define process algebras withquantified transitions....
Abstract ory of concurrency; the symbol; represents We present a simple process algebra which suppor...
AbstractA new bisimulation based semantics, called performance equivalence, is proposed for a proces...
AbstractThe modeling and analysis experience with process algebras has shown the necessity of extend...
The modeling and analysis experience with process algebras has shown the necessity of extending them...
We present a process algebra for the performance modeling and evaluation of concurrent systems whose...
Abstract. We present a process algebra for the performance modeling and evaluation of concurrent sys...
AbstractGlobal-clock-bounded equivalence has been proposed in the literature as a performance-sensit...
AbstractThis paper surveys the theoretical developments in the field of stochastic process algebras,...
AbstractMore than 15 years ago, Cleaveland and Hennessy proposed an extension of the process algebra...
This paper surveys the theoretical developments in the field of stochastic process algebras, process...
AbstractWe present a simple process algebra which supports a form of refinement of an action by a pr...
AbstractAn operational semantics for an algebraic theory of concurrency that incorporates a notion o...
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...
Abstract. The paper introduces a new approach to define process algebras withquantified transitions....
Abstract ory of concurrency; the symbol; represents We present a simple process algebra which suppor...