Milner, R.: Communication and Concurrency. Series in Computer Science. Prentice Hall (1989)  Home/Search   Document Not in Database   Summary   Related Articles   Check

....with free variables in the bodies of constant definitions. Now assuming that the operational rules for parameterless recursion are the same as for rec p , one may wonder about the scope of the free variables in definitions bodies. Is it some kind of dynamic scoping similar to that of CCS [8] and, most notably, as it is in the standard model of concurrent constraint programming [18] Is it static as in most programming languages . The next section answers this question. Let us first illustrate what we mean by dynamic and static scoping. Example 1. Consider a constant identifier A ....

R. Milner. Communication and Concurrency. Int. Series in Computer Science. Prentice Hall, 1989.

....theory, processes are often represented by state machines and Petri Nets. State machines, by definition, have no explicit representation of concurrency, and they identify concurrent actions with sequential, interleaved actions. Process theories based on state machines, exemplified by Milner s CCS [30] and Hoare s CSP [21] typically have associated combinators for composing large processes from smaller components, compositional techniques for reasoning about processes through reasoning about their components, sound and complete techniques for reasoning about process equivalence, and algorithms ....

....model is inherently inadequate for describing even the simplest forms of action refinement on concurrent processes. In particular, the state machines of Figure 1 2 are distinguished by all the state machine based process equivalences in the literature, including bisimulation equivalence (CCS) [30], partial trace equivalence, failures equivalence (CSP) 8, 9] and Hennessy s Testing equivalence [19] an elegant experimental justification for partial traces and failures. We remark that the operation of refining transitions in a state machine does model action refinement of purely sequential ....

[Article contains additional citation context not shown here]

R. Milner. Communication and Concurrency. Series in Computer Science. Prentice-Hall, Inc., 1989.

.... For instance, equational theories have been applied to the derivation of functional programs: the application of the theory transforms simple but inefficient code to complex but efficient programs [11] There are many general theories for parallel programming, such as Unity [13] CSP [34] and CCS [57]. These theories are concerned with the basic semantics of parallel systems, and are not usually used to derive programs mechanically. In order to jointly achieve the goals of mechanization and efficiency, we restrict the problem domain until it is amenable to a formal approach to the infusion of ....

R. Milner. Communication and Concurrency. Series in Computer Science. Prentice-Hall Int., 1989.

....The AGEL [1] development environment for ESTEREL provides high quality tools, including an editor, compiler, simulator, debugger, and verifier. The verifier provides a graphical representation of the generated state machine, and computes reduced state machines based on bisimulation equivalence [12]. The simulator supports interactive execution of ESTEREL programs, by allowing the user to provide input signals and corresponding values and observe the output signals and corresponding values that are produced in response. In conjunction, the execution of the ESTEREL source code and the ....

R. Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall, 1989.

....of UML [4] We let A 2 F;C 2 Conf A ; E 2 ##E#;P 2 2 #T H# be respectively a generic automaton, a configuration, an environment and a set of transitions. The proofs are carried out by induction either on the length of the derivation for proving A P : #C; E# L , #C 0 ; E 0 # [9] or on the structure of the subset of F affected by C, fA 2 F jC##A 6= g, 7] The following proposition guarantees that after firing a transition again a status is reached. Proposition 4 Fo r a l l L 2 2 #T H# ; C 0 ; E 0 the following holds: A P : #C; E# L , #C 0 ; E 0 # # ....

R. Milner. Communication and Concurrency.Series in Computer Science. Prentice Hall, 1989.

....and report on its performance for, say, a given number of resources or a particular set of conditions. In practice this mode can be very useful in helping to correctly dimension the system. The labeling of Camila components with behavioral properties, resorting to a process algebra notation (e.g. [Mil89]) or to a suitable modal logic (e.g. Sti92] is studied in [Bar94] This paves the way to a more general understanding of the nature of formal software components as communicating autonomous agents. 3.4.1 Communication Primitives The communication primitives available in Camila are based on ....

A. J. R. G. Milner. Communication and Concurrency. Series in Computer Science. PrenticeHall International, 1989.

.... results described in this paper have been used to integrate process algebraic methods into (concurrent) object oriented programming [8] 1 Introduction The aim of this research is to enhance the practice of threads programming with ideas from the theory of concurrency, such as process algebras [21, 15, 2] and synchronous programming languages (see [14, 4] for surveys) In particular, we want to build a process algebraic application programming interface (API) combining threads and events. To ensure that this API can (re)use the extensive existing work in both the design and implementation of ....

R. Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall, 1989.

....transition systems with independence (cf. Proc. CONCUR 96) and yielding a precise characterisation of transition systems with independence and multi arcs in terms of (event maximal, diamond extensional) labeled asynchronous transition systems. Introduction Following the leading idea of CCS [12] and related process calculi [11, 2, 13, 9] the behaviour of concurrent systems is often specified extensionally by describing their state transitions and the observable behaviours that such transitions produce. The simplest formal model of computation able to express naturally this idea is ....

R. MILNER, Communication and Concurrency. Series in Computer Science (####), Prentice Hall.

....doesn t fully exploit the temporal order relations between operations. In order to do this, a process algebraic approach is better suited and gives a complementary view on the system under specification. Here, Lotos has been chosen out of other available notations, such as CSP [Hoa78] and CCS [Mil89], mainly because it is the only formal specification language that has been standardised so far. Since we are concerned with the relationship of operations within synchronizable objects, only basic Lotos is used. A more complete analysis can be performed by extending the basic specification with ....

R. Milner. Communication and Concurrency. Series in Computer Science. Prantice Hall, 1989.

....door is open. The only relevant events (signals in Esterel ) are the events lift stop and door closed and the output events are open command and motor. To verify the above property, we translate the Statecharts in Esterel and obtain the reduced automata by FC2TOOLS using the notion of bisimulation [14] . The reduced automata is shown in g 7. The input and output events are pre xed with and respectively. The states are shown by concentric circles and the initial state is the one on top left corner of the gure. If we assume that the door is initially closed(implied by the initial state ....

R. Milner:Communication and Concurrency, Series in Computer Science, Prentice Hall, 1989.

....dependences between observable classes. This may lead to added observations (see our example in Sect. 6) Our concept of an observable part refines the concept of an observable part defined for algebraic specifications in [3, 4, 20, 24] and the concept of a visible action in process algebras in [19]. Our extension covers the addition of attributes and messages and the refinement of the class hierarchy and of communication protocols. In the following, we make two suggestions for relating the behavior of an abstract specification to a concrete specification: behavioral transition refinement ....

R. Milner. Communication and Concurrency. Series in Computer Science. Prentice /Hall, Int., 1989.

....semantics. 1 Introduction There are essentially two trends to add parallel constructs to a functional language. On the one hand, the approach adopted by the ML community [17] consists in adding to the language the notions of processes, channels and communications as in calculi like CCS [16]. An operational semantics is given in [15] and several implementations were realised (PFL [11] CML [24] Its main drawback is that the language is no longer functional and that it requires another programming methodology to develop parallel applications. On the other hand, one can preserve the ....

....o ered by = in gure 1 by a function creating a process modelling a store. A store is a data structure created by the constructor make store, accessed by read and modi ed by write. An operational semantics of parallel ML is given in [15] by a set of transition rules similar to those of CCS ([16]) We illustrate in gure 2 some of them which are suitable for = Those rules concern 2 (define (make store c init value) define (read c) define (write c v) fork (lambda ( let ( value (receive c) begin (receive c) letrec ( loop (lambda (v) begin (send c value) send c v) ....

Robin Milner. Communication and Concurrency. Series in Computer Science. Prentice-Hall, 1989. 15

....semantics. 1 Introduction There are essentially two trends to extend a functional language with parallel constructs. On the one hand, the approach adopted by the ML community [22] consists in adding to the language the notions of processes, channels, and communications as in calculi like CCS [21]. An operational semantics is given in [2] and several implementations were realised (PFL [17] CML [32] Its main drawbacks are that the language is no longer functional and that it requires another programming methodology to develop parallel applications. On the other hand, one can preserve the ....

....on channel by a sending process during a synchronous communication. For readability purpose, we add the usual syntactic sugar let, begin and letrec in = as we did in C . An operational semantics of parallel ML is given in [2] by a set of transition rules similar to the ones of CCS [21]. Using a similar approach, we give a semantics to = this semantics consists of a set of rules that allow us to infer transitions between con gurations. A con guration is represented by the notation hK; I; Si j P . In a con guration, K denotes a set of channels, I a set of process identi ers, ....

Robin Milner. Communication and Concurrency. Series in Computer Science. PrenticeHall, 1989.

....AL. The AGEL [1] development environment for Esterel provides high quality tools, including an editor, compiler, simulator, debugger, and verifier. The verifier provides a graphical representation of the generated state machine, and computes reduced state machines based on bisimulation equivalence [18]. The simulator supports interactive execution of Esterel programs, by allowing the user to provide input signals and corresponding values and observe the output signals and corresponding values that are produced in response. In conjunction, the execution of the Esterel source code and the ....

R. Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall, 1989.

....the command, and that the system may take a potentially arbitrary amount of time to do that. 2.1. 1 May Preemption May preemption is the only form of preemption that can be defined in (standard) Unix, in concurrent programming languages such as CSP [22] or in process calculi of the CCS family [24]. The reason is that these systems or formalisms are based on time independence: the semantics of a set of communicating processes does not depend on their relative timings. Because of its intrinsic simplicity and of its natural compositional character, time independence is a very elegant and ....

R. Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall, 1989.

....safety results for abstractions within and across such views for the entire modal mu calculus and show that such abstractions allow for some compositional reasoning with respect to a uniform family of process algebras a la CCS. 1 Introduction and Motivation Process algebras such as Milner s CCS [16] and modular guarded command languages such as McMillan s SMV [15] are important description languages for a wide range of computer systems. The operational meaning of such descriptions is typically captured by a triple M = S; R; L) where S is a set of states, R the state transition relation, ....

....It is easily seen that these functions FD are monotone, so they have a greatest fixed point vD which is also the greatest D refinement. One may readily show that D refinements are closed under all unions and relational composition. For D being K, K refinements are simply Milner s bisimulations [16] for all eventbased models ( trivial labeling function) To illustrate, consider the model in Figure 1(d) If we annotate all transitions of Figure 1(a) with [1; 1] and remove the state error, then the resulting system is an I refinement of the system in (d) Similarly, if we write [p; p] for ....

[Article contains additional citation context not shown here]

R. Milner. Communication and Concurrency. Series in Computer Science. PrenticeHall International, 1989.

No context found.

Robin Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall, 1989.

....approaches to semantics of concurrent reactive systems. The term calculus indicates that one of the main objectives in the development of CCS was to give a careful treatment of the structural properties of such systems, o#ering an algebraic theory for concurrency. The primary reference is the book [90] which also includes a short description of related approaches and the development leading to CCS. Agents with finite behaviour are constructed via the basic operators of action prefixing, #.t ccs t ccs t 1 ccs t # 1 t 2 # L ....

....sign is usually omitted for a unary sum, the infix summation t 1 t 2 is used as short notation for the binary sum. The term 0 was introduced as a short notation for the empty sum, representing an agent with no actions. One of the ways of introducing agents with infinite behaviour given in [90] is to add process variables and a constructor for recursion, extending the grammar by where x is a process variable. The standard operational semantics of CCS is given by a Plotkin style structural operational semantics [107] as shown in Fig. 1.1, consisting of a set of syntax directed ....

[Article contains additional citation context not shown here]

Robin Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall, 1989.

No context found.

Milner, R.: Communication and Concurrency. Series in Computer Science. Prentice Hall (1989)

No context found.

R. Milner. Communication and Concurrency. Series in Computer Science. PrenticeHall International, 1989.

No context found.

R. Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall, 1989.

No context found.

R. Milner. Communication and Concurrency. Series in Computer Science. PrenticeHall International, 1989.

No context found.

R. Milner. Communication and Concurrency. Series in Computer Science. PHI, 1989.

No context found.

R. Milner. Communication and Concurrency. Series in Computer Science. PrenticeHall International, 1989.

No context found.

Milner, R.: Communication and Concurrency. Series in Computer Science. Prentice Hall (1989)

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