Add to ORKGWe define a class of process algebras with silent step and a generalised operation $gsum{$ that allows explicit treatment of emph{alternative quantification over data, and we investigate the specific subclass formed by the algebras of finite processes modulo rooted branching bisimulation. We give a ground complete axiomatisation for those branching bisimulation algebras of which the data part has built-in equality and Skolem functions
AbstractIn this study, we present rule formats for four main notions of bisimulation with silent mov...
In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent move...
AbstractIn TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with sil...
We define a class of process algebras with silent step and a generalised operation $gsum{$ that allo...
This paper studies the interaction of prefix iteration with the silent step in the setting of branch...
Groote and Luttik (1998a) proved that the extension of the theory pCRL with the axioms for branching...
We define a class of process algebras with a generalised operation $sum$ that allows explicit treatm...
This paper studies the interaction of prefix iteration μ*x with the silent step τ in the setting of...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
This thesis is concerned with the algebraic theory of finite state processes. The processes we focus...
Permission of the editors to include the present Chapter I here is gratefully acknowledged. In this ...
Abstract. The paper introduces a new approach to define process algebras withquantified transitions....
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics ...
The branching bisimulation defined by Van Glabbeek and Weijland takes care of preserving the branchi...
We identify two features of common process algebra operations: their first-order flavour and the fac...
AbstractIn this study, we present rule formats for four main notions of bisimulation with silent mov...
In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent move...
AbstractIn TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with sil...
We define a class of process algebras with silent step and a generalised operation $gsum{$ that allo...
This paper studies the interaction of prefix iteration with the silent step in the setting of branch...
Groote and Luttik (1998a) proved that the extension of the theory pCRL with the axioms for branching...
We define a class of process algebras with a generalised operation $sum$ that allows explicit treatm...
This paper studies the interaction of prefix iteration μ*x with the silent step τ in the setting of...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
This thesis is concerned with the algebraic theory of finite state processes. The processes we focus...
Permission of the editors to include the present Chapter I here is gratefully acknowledged. In this ...
Abstract. The paper introduces a new approach to define process algebras withquantified transitions....
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics ...
The branching bisimulation defined by Van Glabbeek and Weijland takes care of preserving the branchi...
We identify two features of common process algebra operations: their first-order flavour and the fac...
AbstractIn this study, we present rule formats for four main notions of bisimulation with silent mov...
In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent move...
AbstractIn TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with sil...