AbstractIn order to provide an algebraic semantics for recursively defined (nonterminating) processes there is a well-known metric approach leading from process algebras to complete process algebras. In order to obtain an algebraic specification and completion of such algebras, it is sufficient and much more convenient to consider, instead of metric spaces, only spaces with a suitable family of projections, called projection spaces. Projection spaces and algebras are shown to be a suitable basis for an algebraic semantics of combined data type and process specifications
Abstract. In this paper, we present a symbolic reachability algorithm for process algebras with recu...
AbstractRecent approaches to the combination of process algebras and temporal logic have shown that ...
Abstract: The object of this paper is to design a theoretical framework for the algebraic specificat...
AbstractIn order to provide an algebraic semantics for recursively defined (nonterminating) processe...
SIGLEAvailable from TIB Hannover: RN 2856(1990,1) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...
We provide rules for calculating with invariants in process algebra with data, and illustrate these ...
We define an equivalence relation on recursive specifications in process algebra that is model-indep...
AbstractA process concept is introduced similar to that of Staples and Nguyen (Theoret. Comp. Sci. 2...
The three classical process algebras CCS, CSP and ACP present several differences in their respectiv...
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
An extension of Milner's CCS is presented. The language takes into account a number of resourc...
Abstract. Program algebra (PGA) is a basic and simple concept of a programming language which has be...
AbstractAfter 25 years of research (19 personally) into process algebras, I ask what areas of mathem...
textabstractThis paper presents a new semantics of ACPτ, the Algebra of Communicating Processes with...
In recent years a wide variety of process algebras has been proposed in the literature. Often these ...
Abstract. In this paper, we present a symbolic reachability algorithm for process algebras with recu...
AbstractRecent approaches to the combination of process algebras and temporal logic have shown that ...
Abstract: The object of this paper is to design a theoretical framework for the algebraic specificat...
AbstractIn order to provide an algebraic semantics for recursively defined (nonterminating) processe...
SIGLEAvailable from TIB Hannover: RN 2856(1990,1) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...
We provide rules for calculating with invariants in process algebra with data, and illustrate these ...
We define an equivalence relation on recursive specifications in process algebra that is model-indep...
AbstractA process concept is introduced similar to that of Staples and Nguyen (Theoret. Comp. Sci. 2...
The three classical process algebras CCS, CSP and ACP present several differences in their respectiv...
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
An extension of Milner's CCS is presented. The language takes into account a number of resourc...
Abstract. Program algebra (PGA) is a basic and simple concept of a programming language which has be...
AbstractAfter 25 years of research (19 personally) into process algebras, I ask what areas of mathem...
textabstractThis paper presents a new semantics of ACPτ, the Algebra of Communicating Processes with...
In recent years a wide variety of process algebras has been proposed in the literature. Often these ...
Abstract. In this paper, we present a symbolic reachability algorithm for process algebras with recu...
AbstractRecent approaches to the combination of process algebras and temporal logic have shown that ...
Abstract: The object of this paper is to design a theoretical framework for the algebraic specificat...