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
AbstractWe present an axiom system ACP, for communicating processes with silent actions (‘τ-steps’)....
The three classical process algebras CCS, CSP and ACP present several differences in their respectiv...
AbstractAfter 25 years of research (19 personally) into process algebras, I ask what areas of mathem...
AbstractIn order to provide an algebraic semantics for recursively defined (nonterminating) processe...
We provide rules for calculating with invariants in process algebra with data, and illustrate these ...
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
AbstractThis paper deals with underspecification for process algebras which is relevant in early des...
The three classical process algebras CCS, CSP and ACP present several differences in their respectiv...
This paper presents a new semantics of ACPτ, the Algebra of Communicating Processes with abstraction...
AbstractThe three classical process algebra CCS, CSP and ACP present several differences in their re...
AbstractA review is given of the design rationale for ACP style process algebras. An outline of futu...
AbstractA process concept is introduced similar to that of Staples and Nguyen (Theoret. Comp. Sci. 2...
We define an equivalence relation on recursive specifications in process algebra that is model-indep...
AbstractWe construct a graph model for ACPτ, the algebra of communicating processes with silent step...
AbstractWe investigate the defining power of finite recursive specifications over the theory with + ...
AbstractWe present an axiom system ACP, for communicating processes with silent actions (‘τ-steps’)....
The three classical process algebras CCS, CSP and ACP present several differences in their respectiv...
AbstractAfter 25 years of research (19 personally) into process algebras, I ask what areas of mathem...
AbstractIn order to provide an algebraic semantics for recursively defined (nonterminating) processe...
We provide rules for calculating with invariants in process algebra with data, and illustrate these ...
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
AbstractThis paper deals with underspecification for process algebras which is relevant in early des...
The three classical process algebras CCS, CSP and ACP present several differences in their respectiv...
This paper presents a new semantics of ACPτ, the Algebra of Communicating Processes with abstraction...
AbstractThe three classical process algebra CCS, CSP and ACP present several differences in their re...
AbstractA review is given of the design rationale for ACP style process algebras. An outline of futu...
AbstractA process concept is introduced similar to that of Staples and Nguyen (Theoret. Comp. Sci. 2...
We define an equivalence relation on recursive specifications in process algebra that is model-indep...
AbstractWe construct a graph model for ACPτ, the algebra of communicating processes with silent step...
AbstractWe investigate the defining power of finite recursive specifications over the theory with + ...
AbstractWe present an axiom system ACP, for communicating processes with silent actions (‘τ-steps’)....
The three classical process algebras CCS, CSP and ACP present several differences in their respectiv...
AbstractAfter 25 years of research (19 personally) into process algebras, I ask what areas of mathem...