M. Hennessy and H. Lin. Unique Fixpoint Induction for Message-Passing Process Calculi. CATS'97, Proc. Computing: the Australasian Theory Symposium, pages 122-131. 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Planning Proofs of Correctness of CCS Systems UNIVER - Monroy-Borja (1997) (Correct)
....behaviour from reasoning about data expressions. Thus, A vp is parameterised by auxiliary proof systems over data expressions, and, so, its completeness is relative to that of the parameter theory. Although Hennessy and Lin have also invented message passing proof systems for recursive processes [Hennessy Lin 97] we shall concentrate on A vp only, since that suffices for the purpose of this section, namely: to evidence the extensibility of the equational approach to verification. In what follows, we use the syntax of value passing CCS, introduced in Section 2.2.1, with the following extensions: b . P = ....
....specifications have to be explicitly given by means of the definition facility, def = using guarded and sequential sets of equations. Furthermore, specifications of the form of indexed process families have to be 1 depth declarations, a stronger version of the notion of declaration, given in [Hennessy Lin 97] Definition 5.1 (Declaration) The set of definitions 1 e S def = e Ef e S= e Xg is called a declaration if it satisfies the following conditions: 1. the expressions e Ef e S= e Xg contain at most the process constants e S; and 2. S i = S j implies i = j. Roughly, a declaration is a ....
[Article contains additional citation context not shown here]
M. Hennessy and H. Lin. Unique fixpoint induction for messagepassing process calculi. In Computing: The Australasian Theory Symposium (CATS'97), 1997. Also available from Sussex as Computing Science Technical Report 6/95.
Unique Fixpoint Induction for Value-Passing Processes (Extended.. - Rathke (1997) (1 citation) (Correct)
.... proposed to equationally characterise bisimulation and observational congruence in CCS was that of unique fixpoint induction [8, 9, 10] Recently, attempts have been made to generalise this proof technique to process calculi which feature communication of data, that is, value passing languages [3, 6]. These attempts were reasonably successful in that complete proof systems for strong bisimulation equivalence were found for regular, guarded, terms of both the calculus and value passing CCS. In the latter case however completeness was obtained for a restricted form of process. In a ....
....form of process. In a value passing language it is common to allow parameterised agents. For example, Xhx; yi ( c (x y) X(x 1; y 3) would describe a process, which, when instantiated to the pair (0; 0) say, would successively output the sequence 0; 3; 12; 27; The results obtained in [3] applied to processes which enjoy a very simple form of parameterisation: arguments to the agent identifiers must be a vector of variable names only. So recursive calls such as X(x 1; y 3) in the example above would be disallowed. We examine the approach of [3] to ascertain why this restriction ....
[Article contains additional citation context not shown here]
M. Hennessy and H. Lin. Unique fixpoint induction for message-passing process calculi. In Proceedings of CATS97, Computing:Australian Theory Symposium, 1997. To appear. Also available as a University of Sussex technical report.
A Symbolic Approach to Value-Passing Processes - Ingólfsdóttir, Lin Self-citation (Lin) (Correct)
No context found.
M. Hennessy and H. Lin. Unique Fixpoint Induction for Message-Passing Process Calculi. CATS'97, Proc. Computing: the Australasian Theory Symposium, pages 122-131. 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC