Results 1 
3 of
3
Algebraic Process Verification
 Handbook of Process Algebra, chapter 17
"... This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras. ..."
Abstract

Cited by 62 (16 self)
 Add to MetaCart
This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras.
A brief history of process algebra
 Theor. Comput. Sci
, 2004
"... Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The a ..."
Abstract

Cited by 56 (1 self)
 Add to MetaCart
Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The author gives his personal views on these matters. He also considers the present situation, and states some challenges for the future.
Symbolic Techniques for Valuepassing Calculi
 University of Sussex
, 1997
"... We investigate the use of symbolic operational semantics for valuepassing process languages. Symbolic semantics provide analytical tools for reasoning about particular infinite state systems where traditional methods fail. We eschew the use of Milner's encoding of valuepassing agents into pure pro ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We investigate the use of symbolic operational semantics for valuepassing process languages. Symbolic semantics provide analytical tools for reasoning about particular infinite state systems where traditional methods fail. We eschew the use of Milner's encoding of valuepassing agents into pure process algebra and advocate the treatment of valuepassing terms as firstorder processes proper. Such an approach enables us to build finitary proof systems for reasoning within a variety of valuepassing calculi. All work carried out here is parametric with respect to the language of data expressions and, as such, reasoning about processes must be done relative to reasoning about data. Firstly, we consider...