R. Milner. The polyadic pi-calculus: a tutorial. Technical Report ECS-LFCS-91180, University of Endinburgh, 1991. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Redesign of the Oz Compiler - Bohlin, Bruce (2002) (Correct)
....The primitives of the if calculus are logic variables and names (which has been previously described) procedural abstractions, and cells. Cells provide an expressions of state that is fully compatible with concurrency and constraints. The if calculus is closely related to the r calculus ([8, 9, 10]) as described by Schulte in [7] The if calculus can be extended in various ways, for example with primitives providing for constraint based problem solving in the style of logic programming, and with primitives that allow for lazy evaluation and embedding of both the eager and the lazy ....
R. Milner. The polyadic pi-calculus: a tutorial, 1991.
Modeling Software Components Using Behavior Protocols - Visnovsky (2003) (4 citations) (Correct)
....of their communication topology. LEDA does not support connectors. Dynamic architectures are created by using static, reconfigurable (condition based) and multiple (arrays of instances) attachments in the composed components. As a basis of a dynamic reconfiguration support LEDA uses calculus [39], a formalism related to CCS [38] targeting mobility and dynamic communication. Each component and role (similar to an interface in SOFA) is described as a calculus process, where all roles of a component form the interface (observable black box behavior) of the component. Based on the ....
R. Milner, "The Polyadic pi-Calculus: A Tutorial," in Logic and Algebra of Specification, F. L. Hamer, W. Brauer and H. Schwichtenberg (eds.), Springer-Verlag 1993.
PICCOLA - a Small Composition Language - Achermann, Lumpe, Schneider.. (1999) (17 citations) (Correct)
....the #L channel, one has to use the corresponding bindings of the returned form. Similarly, the function concat(F) G) implements the polymorphic extension of the form F by G. Finally, constants like numbers or strings can be represented in the pure #L calculus using the scheme presented by Milner [Mil91] or Turner [Tur96] for the # calculus. Therefore, adding constant values to the PICCOLA language does not change the underlying semantics. However, if constant values are available, then calculations involving such values are more efficient. 1.4.2 Implementation of PICCOLA We have implemented ....
Robin Milner. The polyadic Pi-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Computer Science Department, University of Edinburgh, UK, October 1991.
A Translation of the Pi-Calculus Into MONSTR - Banach, Balazs, Papadopoulos (1995) (2 citations) (Correct)
....recognise each others use of the word. The work in this paper may partly be seen as a comparison of notions of process from the first two of these, since in presenting a translation from the re calculus to MONSTR, both areas may be brought into contact. The re calculus [Milner et ah (1992) Milner (1993a)] arose as a generalisation of CCS [Milner (1989) to allow networks of processes to evolve dynamically. It is thus a process algebra language. MONSTR by contrast is a generalised term graph rewriting language that was used as the intermediate language for the Flagship machine. See [Banach et al. ....
....the reader is refered to [Banach (1993a) for a fuller discussion. 349 THE PI CALCULUS The re calculus first appeared in [Milner et al. 1992) and since that time has been seen in a number of minor variants. We will fix on a version of the monadic calculus, as presented in the first part of [Milner (1993a)] since it is in many ways the most economic version, and so leads to the most transparent translation. We regard as given a suitable alphabet OH of channel names, ranged over by x, y, z etc. Here is the formal syntax. Definition 3.1 The re calculus language of process expressions is given by ....
Milner R., The Polyadic Pi-Calculus: A Tutorial. in: Logic and Algebra of Specification, Bauer, Brauer, Schwichtenberg (eds.), 203-246, Springer, (1993).
Component Indicators for Architecture Interaction Assessment - Payton, Davis, Gamble.. (Correct)
....below. Because of its focus on components, Darwin is a good fit for specifications resulting from the AIC protocol information. Recall from Section 2 that, in Darwin, a component is specified in terms of the services provided and required. This representation is in the form of calculus [23]. The access names in Darwin of the provided and required services are mapped to the AIC role name indicators of the components. The service name in Darwin is mapped to a components instantiated name, when that name becomes known. name TransactionController roles TransControl in protocol ....
Milner, R. The Polyadic PI-Calculus: a Tutorial. In Bauer, F., Brauer, W., Schwichttenberg, H., eds. Logic and Algebra of Specification. Springer Verlag, 1993.
Proof of the subject reduction property for a π-calculus in.. - Henry-Gérard (1999) (Correct)
....description of calculus fundations can be found in [8] A natural extension of the monadic calculus consists in considering name tuples as the values that can be passed between processes , instead of just names : the polyadic calculus. This version of calculus, described by R. Milner in [7], allows the introduction of a rst notion of discipline on the use of names, since a reduction can be incorrect because of an arity mismatch. An other constraint on the use of names is introduced by D. Sangiorgi [9] 10] and concerns the directionality of names, that is, their ability to be used ....
....piece of data that will be subsituted for m in its continuation P . The OUTPUT operator nm:P allows to transmit as data the name m on the chanel named n. The (n : t)P , RESTRICTION operator, restricts the visibility of the name n to its body P . P denotes an process with innite behavior (cf. [7]) We call P r I the set of processes syntactically dened this way. 2.1.2 Syntax in the COQ proof assistant The system used here is an alternative to the use of de Bruijn indices [3] The names are coded by a dioeerent constructor depending on the fact that they are in a bound position or in a ....
Robin Milner. The polyadic pi-calculus : a tutorial. Technical Report ECS-LFCS-91-180, LFCS, 1991.
Components, Scripts and Glue - Schneider, Nierstrasz (1999) (5 citations) (Correct)
....that allows one to express applications as compositions in terms of components, scripts, and glue. In order to support formal reasoning about architectural styles and concrete compositions, this language is being developed with a formal semantics based on ##,avariantofthe polyadic # calculus [21]. This chapter is organized as follows: in Section 2, we summarize the state of theart in component technology and analyze problems with existing approaches. In Section 3, we introduce a conceptual framework for software composition as an approach to overcome these problems. We present our ....
Robin Milner. The Polyadic Pi-Calculus: a Tutorial. Technical Report ECSLFCS -91-180, Computer Science Department, University of Edinburgh, UK, October 1991.
Causality and True Concurrency: A Data-flow - Analysis Of The (Correct)
No context found.
R. Milner. The polyadic pi-calculus: a tutorial. Technical Report ECS-LFCS-91180, University of Endinburgh, 1991.
Resources, Concurrency and Local Reasoning - O'Hearn (2005) (Correct)
No context found.
R. Milner. The polyadic pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203--246. Springer-Verlag, 1993.
Universita degli Studi di Pisa - Facolta Di Scienze (Correct)
No context found.
R. Milner. The polyadic pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203--246. Springer-Verlag, 1993. http://citeseer.ist.psu. edu/milner91polyadic.html.
Formal Security Analysis of Basic Network-Attached Storage - Chaudhuri, Abadi (2005) (Correct)
No context found.
R. Milner. The polyadic pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203--246. Springer-Verlag, 1993.
Formal Security Analysis of Basic Network-Attached Storage - Chaudhuri, Abadi (Correct)
No context found.
R. Milner. The polyadic pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203--246. Springer-Verlag, 1993.
Component Composition Errors and Update - Atomicity Static Analysis (2005) (Correct)
No context found.
Milner R. The polyadic pi-calculus: a tutorial. In Logic and Algebra of Specification, 203--246, Springer-Verlag, 1993.
Basic Research in Computer Science - Recursion Vs Replication (Correct)
No context found.
R. Milner. The polyadic pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203--246. Springer-Verlag, 1993.
A Framework for Specifying and Verifying the Behaviour.. - Bracciali, Brogi, Turini (2004) (Correct)
No context found.
R. Milner, The polyadic pi-calculus: a tutorial, in: F. L. Bauer, W. Brauer, H. Schwichtenberg (Eds.), Logic and Algebra of Specification, Springer-Verlag, (1993) 203--246.
D-Fusion: a Distinctive Fusion Calculus - Boreale, Buscemi, Montanari (Correct)
No context found.
R. Milner. The Polyadic pi-Calculus: a Tutorial. Technical Report, Computer Science Dept., University of Edinburgh, 1991.
Preuve de la conservation des types du π-calcul en COQ - Henry-Gréard (1998) (Correct)
No context found.
Robin Milner. The polyadic pi-calculus : a tutorial. Technical Report ECS-LFCS-91-180, LFCS, 1991.
Notations for the Specification and Verification of.. - Woodman Palmer.. (2004) (1 citation) (Correct)
No context found.
R. Milner. The Polyadic pi-Calculus: A Tutorial. In Logic and Algebra of Specification. 1993.
Component Composition Errors and Update Atomicity: Static.. - Adamek, Plasil (2003) (28 citations) (Correct)
No context found.
Milner R. The polyadic pi-calculus: a tutorial. In Logic and Algebra of Specification, 203--246, Springer-Verlag, 1993.
Notations for the Specification and Verification.. - Woodman, Palmer.. (2004) (1 citation) (Correct)
No context found.
R. Milner. The Polyadic pi-Calculus: A Tutorial. In Logic and Algebra of Specification. 1993.
Resources, Concurrency and Local Reasoning - O'Hearn (Correct)
No context found.
R. Milner. The polyadic pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203--246. Springer-Verlag, 1993.
μABC: A Minimal Aspect Calculus - Bruns, Jagadeesan, Jeffrey, Riely (2004) (1 citation) (Correct)
No context found.
R. Milner. The polyadic pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203--246. SpringerVerlag, 1993.
µABC: A Minimal Aspect Calculus - Bruns, Jagadeesan, Jeffrey, Riely (2004) (1 citation) (Correct)
No context found.
R. Milner. The polyadic pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203--246. Springer-Verlag, 1993.
Information Flow Security and Recursive Systems - Bossi, Macedonio, Piazza, Rossi (Correct)
No context found.
R. Milner. The Polyadic Pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Speci cation, pages 203-246. Springer-Verlag, 1993.
Automated Software Engineering Using Concurrent Class.. - Grosu, Liu, Smolka.. (2001) (1 citation) (Correct)
No context found.
R. Milner. The polyadic pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203--246. SpringerVerlag, 1993.
First 50 documents
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