This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation
AbstractIn ACP-style process algebra, the interpretation of a constant atomic action combines action...
Process algebra is a theoretical framework for the modelling and analysis of the behaviour of concur...
AbstractThe usage of process algebras for the performance modeling and evaluation of concurrent syst...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
AbstractA new bisimulation based semantics, called performance equivalence, is proposed for a proces...
Process algebras are a frequently used tool for the specification and verification of distributed re...
Abstract. The paper introduces a new approach to define process algebras withquantified transitions....
AbstractOne of the most satisfactory results in process theory is Milner's axiomatization of strong ...
AbstractThis talk offers a survey of negative results on the existence of finite equational axiomati...
The dynamics of process calculi, e.g. CCS, have often been defined using a labelled transition syste...
The possibility of two or more actions to be performed consecutively at the same point in time is n...
AbstractThe algebra of timed processes, ATP, uses a notion of discrete global time and suggests a co...
This thesis contributes to the study of semantics for the specification and the verification of reac...
AbstractA standard process algebra is extended by a new action σ which is meant to denote idling unt...
AbstractThis paper raises the question on how to specify timeouts in process algebra, and finds that...
AbstractIn ACP-style process algebra, the interpretation of a constant atomic action combines action...
Process algebra is a theoretical framework for the modelling and analysis of the behaviour of concur...
AbstractThe usage of process algebras for the performance modeling and evaluation of concurrent syst...
In this paper, we propose the notion of partial time abstraction for timed process algebras, which i...
AbstractA new bisimulation based semantics, called performance equivalence, is proposed for a proces...
Process algebras are a frequently used tool for the specification and verification of distributed re...
Abstract. The paper introduces a new approach to define process algebras withquantified transitions....
AbstractOne of the most satisfactory results in process theory is Milner's axiomatization of strong ...
AbstractThis talk offers a survey of negative results on the existence of finite equational axiomati...
The dynamics of process calculi, e.g. CCS, have often been defined using a labelled transition syste...
The possibility of two or more actions to be performed consecutively at the same point in time is n...
AbstractThe algebra of timed processes, ATP, uses a notion of discrete global time and suggests a co...
This thesis contributes to the study of semantics for the specification and the verification of reac...
AbstractA standard process algebra is extended by a new action σ which is meant to denote idling unt...
AbstractThis paper raises the question on how to specify timeouts in process algebra, and finds that...
AbstractIn ACP-style process algebra, the interpretation of a constant atomic action combines action...
Process algebra is a theoretical framework for the modelling and analysis of the behaviour of concur...
AbstractThe usage of process algebras for the performance modeling and evaluation of concurrent syst...