A. Ing olfsd ottir. A semantic theory for value-passing processes, Late approach, Part II: A behavioural semantics and full abstractness. Report Series RS-95-22, BRICS, Department of Computer Science, University of Aarhus, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....we define a equationally based proof system and show its soundness and completeness with respect to the model. As already explained the construction of the domain equation and thereby the definition of the model is strongly inspired by the idea of bisimulation preorder. In the accompanying paper [Ing94a] it is shown that the original late bisimulation is too strong to meet the preorder of the model ACT . The algebraicity of the model implies that the preorder in the model is completely decided by the compact elements. Behaviourally this can be interpreted as that the preorder may be obtained by ....

....The algebraicity of the model implies that the preorder in the model is completely decided by the compact elements. Behaviourally this can be interpreted as that the preorder may be obtained by finite observations. This is not the case for bisimulation as well known even for the pure calculus. In [Ing94a] a finitary version of the preorder is defined by mimicking the algebraicity of the model on the syntactical level. This preorder is shown to coincide with the preorder in the model in the sense that the model is fully abstract with respect to this preorder. ....

Ing'olfsd'ottir, A., Semantic Theory for Value-Passing Processes, Late Approach, Part II: Behavioural Semantics and Full Abstractness. In preparation.

....For instance the interpretation of an infinite process modelled by an algebraic cpo is fully specified by the interpretation of its finitely computable approximations. This is not the case for many behaviourally based semantics as will be explained in more detail in the sequel to this paper, [Ing95a]. One of the main purposes of this series of papers is to give an operational characterization of the denotational interpretation of a value passing process in an algebraic cpo. Therefore we start by giving a denotational characterization of value passing processes using the late principle. We ....

....of value passing processes using the late principle. We also give an equationally based proof system which can be naturally derived from the denotational semantics and show its soundness and completeness with respect to the denotational semantics. This is the content of this paper. Its sequel, [Ing95a], is devoted to defining operational semantics, analysing operationally the denotational semantics and to define a reasonable behavioural relation between processes which characterizes the relation induced by the denotational semantics. All three models are based on the idea of bisimulation. In ....

[Article contains additional citation context not shown here]

A. Ing'olfsd'ottir. A Semantic Theory for Value-Passing Processes, Late Approach, Part II: A Behavioural Semantics and Full Abstractness To appear as Technical Report, BRICS, Aalborg University.

No context found.

A. Ing olfsd ottir. A semantic theory for value-passing processes, Late approach, Part II: A behavioural semantics and full abstractness. Report Series RS-95-22, BRICS, Department of Computer Science, University of Aarhus, 1995.

No context found.

A. Ing olfsd ottir. A semantic theory for value-passing processes, Late approach, Part I: A denotational model and its complete axiomatization. Report Series RS-95-3, BRICS, Department of Computer Science, University of Aarhus, 1995.

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