F. W. Vaandrager. Process algebra semantics of POOL. In [Bae90], pages 173--236, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of 9 for b a (x) 9 for b c (y where the second ruloid is only present for actions c that are not smaller than a. 72 Protean Specification Languages Case studies in the literature on process algebras often use mechanisms to define new operations on terms. Vaandrager [219] formulated the fresh atom principle to formalize a standard practice in process algebra proofs, namely, the introduction of fresh constants. Verhoef [224, 225] introduced the operator definition principle (similar to RDP as discussed at the end of Sect. 5.4.5) to facilitate the specification ....

F. Vaandrager, Process algebra semantics of POOL, in Baeten [21], pp. 173--236.

.... the join calculus and the # calculus [FG96] of # calculi into process calculi [Mil92, San94b, Lav93, San94a, Tho95, San94b, San95a, ALT95, Ode95b, Nie96] data types and other sequential programming constructs [Mil89, Mil93, Wal91b, Ode95a] from object oriented languages into process calculi [Vaa90, Wal91a, Wal95, Wal93, Jon93, Wal94, PT95], from logic programming languages into the # calculus [Ros93, Li94] and from concurrent constraint languages into the # calculus [Smo94, VP96] The formalization of compilers for concurrent languages has also motivated the study of encodings, e.g. for Occam [Gam91] Facile [Ama94] Urlang ....

F. Vaandrager. Process Algebra Semantics of POOL. In J. Baeten, ed, Application of Process Algebra, pages 173--236. Cambridge University Press, 1990. Earlier version: CWI-Report CS-R8629.

....judgements of IOC. However, it would be dicult to prove behavioural properties of IOC from this interpretation, because very little is known of the theory of the target imperative calculus. Some previous studies of encodings of imperative or OOLs into process calculi, namely [16, Chapter 8] [27], 11] 29, 14] and [24, 10] are an important basis for our work. We brie y comment on the di erences. Milner [16, Chapter 8] showed how to translate a small imperative language into CCS. Vaandrager [27] Jones [11] and Walker, Liu and Philippou [29, 14, 20] have gone further, by translating ....

....studies of encodings of imperative or OOLs into process calculi, namely [16, Chapter 8] 27] 11] 29, 14] and [24, 10] are an important basis for our work. We brie y comment on the di erences. Milner [16, Chapter 8] showed how to translate a small imperative language into CCS. Vaandrager [27], Jones [11] and Walker, Liu and Philippou [29, 14, 20] have gone further, by translating parallel object oriented languages derived from the POOL family. Walker, Liu and Philippou have also used the encodings for proving the validity of certain program transformations on the source languages. The ....

F. Vaandrager. A process algebra semantics of POOL. In Applications of process algebra, volume 17 of Tracts in Theoretical Computer Science, pages 173-236. Cambridge University Press, 1990.

.... of semantic options was illustrated early in the case of POOL, a parallel object oriented language, where variants of the language were treated both using a denotational semantics based on metric spaces [AdBKR89] a traditional operational semantics [ABKR86] and a translation into process algebra [Vaa90] Facile [GMP89] and Concurrent ML [Rep93] CML) are two early concurrent extensions of Standard ML which in a sense rival ERLANG as programming languages. Facile clearly borrows inspiration from process algebra: the basic communication mechanism is synchronous (blocking) where processes ....

F. Vaandrager. A process algebra semantics of pool. In Applications of process algebra, volume 17 of Tracts in Theoretical Computer Science, Cambridge University Press., pages 173--236, 1990.

....judgements of IOC. However, it would be difficult to prove behavioural properties of IOC from this interpretation, because very little is known of the theory of the target imperative calculus. Some previous studies of encodings of imperative or OOLs into process calculi, namely [16, Chapter 8] [27], 11] 29, 14] and [24, 10] are an important basis for our work. We briefly comment on the differences. Milner [16, Chapter 8] showed how to translate a small imperative language into CCS. Vaandrager [27] Jones [11] and Walker, Liu and Philippou [29, 14, 20] have gone further, by translating ....

....studies of encodings of imperative or OOLs into process calculi, namely [16, Chapter 8] 27] 11] 29, 14] and [24, 10] are an important basis for our work. We briefly comment on the differences. Milner [16, Chapter 8] showed how to translate a small imperative language into CCS. Vaandrager [27], Jones [11] and Walker, Liu and Philippou [29, 14, 20] have gone further, by translating parallel object oriented languages derived from the POOL family. Walker, Liu and Philippou have also used the encodings for proving the validity of certain program transformations on the source languages. The ....

F. Vaandrager. A process algebra semantics of POOL. In Applications of process algebra, volume 17 of Tracts in Theoretical Computer Science, pages 173--236. Cambridge University Press, 1990.

....passing of process control data accompanying a document. As it is possible that multiple instances of the same task are active at the same time, one needs to be able to distinguish between messages sent by these different instances. To this end, a rename operator ae ff (inspired by the work in [22], where it was used for the formal semantics of the parallel object oriented language POOL) is used that individualises send related statements. This leads to expressions such as: ae ff (send(c; q 1 ; q n ) Delta X) send(c; q 1 ; q n ) ff Delta ae ff (X) In this equation, ....

F.W. Vaandrager. Process Algebra Semantics of POOL. In J.C.M. Baeten, editor, Applications of Process Algebra, volume 17 of Cambridge Tracts in Theoretical Computer Science, pages 173--236. Cambridge University Press, Cambridge, United Kingdom, 1990.

.... between the join calculus and the calcu lus [FG96] of calculi into process calculi [Mil92, San94b, Lav93, San94a, Tho95, San95a, ALT95, Ode95b, Nie96] data types and other sequential programming constructs [Mil89, Mil93, Wal91b, Ode95a] from object oriented languages into process calculi [Vaa90, Wal91a, Wal95, Wal93, Jon93, Wal94, PT95], from logic programming languages into the calculus [Ros92, Li94] and from concurrent constraint languages into the calculus [Smo94, VP96] The formalization of compilers for concurrent languages has also motivated the study of encodings, e.g. for Occam [Gam91] Facile [Ama94] Urlang ....

F. Vaandrager. Process Algebra Semantics of POOL. In J. Baeten, editor, Application of Process Algebra, pages 173--236. Cambridge University Press, 1990. Earlier version: CWIReport CS-R8629.

....of the translation function, rather formally proving properties about the semantics. Other process algebras have also been used in the definition of language semantics. For instance, Milner defined the semantics of the concurrent and imperative language M using CCS [Mil89] while Vaandrager [Vaa90] and Papathomas [Pap92] use ACP [BW90] and CCS respectively, to provide semantics for object oriented languages. Alternative implementation languages besides Facile are PICT [PT95] and CML [Rep91] however, only Facile has built in support for distribution. 2 The Erken Language The syntax of the ....

F.W. Vaandrager. Process algebra semantics of POOL. In J.C.M. Baeten, editor, Applications of Process Algebra, pages 173--236. Cambridge University Press, 1990.

....and compared. An approach for the semantic definition of a concurrent programming language is by translation of the language constructs to a process calculus. This approach has been used in [5] for the definition of a simple concurrent programming language by translation to CCS and also in [9][14][15] using CCS or other process calculi for defining the semantics of concurrent objectbased languages. There are, however, different ways to translate the constructs of a language to a process calculus. These may vary in the amount of operational detail or may use completely different approaches ....

F.W. Vaandrager, "Process algebra semantics of POOL," in Applications of Process Algebra, ed. J.C. Baeten, Cambridge Tracts in Theoretical Computer Science 17, pp. 173-236, Cambridge University Press, 1990.

....iteration) can be given. A well known one is that an n bounded queue can be given as a parallel composition of n coupled one place bu#ers. In order to specify this, we need parallel composition with communication, encapsulation and abstraction. In terms of the chaining operator of Vaandrager (see [8]) we can give a definition as follows: Queue(1) Elt(1) # # Queue(n 1) Queue(n) # Queue(1) For more details, we refer to [8] Here, we give a di#erent finite specification for the queue, in the signature obtained by adding the state operator of [1] to BPA # # . The state operator is ....

....In order to specify this, we need parallel composition with communication, encapsulation and abstraction. In terms of the chaining operator of Vaandrager (see [8] we can give a definition as follows: Queue(1) Elt(1) # # Queue(n 1) Queue(n) # Queue(1) For more details, we refer to [8]. Here, we give a di#erent finite specification for the queue, in the signature obtained by adding the state operator of [1] to BPA # # . The state operator is indexed by a finite data type S, and comes with two functions: action : A S # A # , giving the action that is executed when an ....

F.W. Vaandrager. Process algebra semantics of POOL. In J.C.M. Baeten, editor, Applications of Process Algebra, number 17 in Cambridge Tracts in Theoretical Computer Science, pages 173--236. Cambridge University Press, 1990.

....In particular, the occurrences of certain atomic processes may have to be restricted to a subsystem. This is achieved by the operator H which encapsulates a process, i.e. renames all atoms in H ae A into ffi . Encapsulation is a special case of renaming atomic actions as introduced in [Vaa90]. Let f be a function from the set A of atomic actions to the set A [ fffig. Then one can define the unary renaming operator ae f , which replaces every occurrence of a constant a 2 A by f(a) Algebra of Communicating Processes (ACP) The next step in the development of the theory is the ....

F.W. Vaandrager. Process algebra semantics of POOL. In [Bae90], pages 173--236, 1990.

....formalization is defined in terms of Process Algebra equations. Process Algebra [BW90] offers a formal framework of sufficient expressive power, is flexible, and supports communication. In previous research, Process Algebra has also been used to describe complex interaction and behaviour, e.g. in [Vaa90] where the object oriented programming language POOL is formalized, and in [Wie90] where it is used to formally define the conceptual modeling language CSML. In [DS95] the dynamic model of the object oriented specification method MERODE is formally defined using an algebra quite similar to ....

....the encapsulation operator contains, among others, the communication operations (Send, Receive, Wait, Ready, Create, WaitCreate) with their parameters, ensuring that these atomic actions can only occur in conjunction with other communication actions. The rewrite operator ae ff is inspired by [Vaa90] where it was used for the formal definition of the Parallel Object Oriented Language (POOL) This rewrite operator instantiates PA expressions with an ff 2 OID that contains the object identifier of the executing object, and is the formal equivalent of a self attribute: all objects have ....

F.W. Vaandrager. Process Algebra Semantics of POOL. In J.C.M. Baeten, editor, Applications of Process Algebra, volume 17 of Cambridge Tracts in Theoretical Computer Science, pages 173--236. Cambridge University Press, Cambridge, United Kingdom, 1990.

....The formalization is defined in terms of Process Algebra equations. Process Algebra [4] offers a formal framework of sufficient expressive power, is flexible, and supports communication. In previous research, Process Algebra has also been used to describe complex interaction and behaviour, e.g. in [30] where the object oriented programming language POOL is formalized, and in [31] where it is used to formally define the conceptual modelling language CSML. In [11] the dynamic model of the object oriented specification method MERODE is formally defined using an algebra quite similar to Process ....

....the encapsulation operator contains, among others, the communication operations (Send, Receive, Wait, Ready, Create, WaitCreate) with their parameters, ensuring that these atomic actions can only occur in conjunction with other communication actions. The rewrite operator ae ff is inspired by [30], where it was used for the formal definition of the Parallel Object Oriented Language (POOL) This rewrite operator instantiates PA expressions with an ff 2 OID that contains the object identifier of the executing object, and is the formal equivalent of a self attribute: all objects have ....

F.W. Vaandrager. Process Algebra Semantics of POOL. In J.C.M. Baeten, editor, Applications of Process Algebra, volume 17 of Cambridge Tracts in Theoretical Computer Science, pages 173--236. Cambridge University Press, Cambridge, United Kingdom, 1990.

No context found.

F. W. Vaandrager. Process algebra semantics of POOL. In [Bae90], pages 173--236, 1990.

No context found.

Frits Vaandrager. Process algebra semantics of POOL. In Jos Baeten, editor, Applica tion of Process Algebra, pages 173236. Cambridge University Press, 1990. Earlier version: CWI-Report CS-R8629.

No context found.

F. Vaandrager. A process algebra semantics in POOL. , 17:173--236, 1990.

No context found.

F. W. Vaandrager. Process algebra semantics of POOL. In [Bae90], pages 173--236. 1990.

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