J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 18(1), 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....i copies of action a. For every natural number n, we shall write [n] in lieu of 1, n . Apart from actions, the signature of the language (A) includes the binary operations of alternative composition and sequential composition familiar from the theory of Basic Process Algebra [4, 8], and a variation on the original binary version of the Kleene star operation [16] that will be referred to as multi exit iteration. For positive integers m and n, the process term (P 1 , Pm ) # (Q 1 , Q n ) stands for an agent whose behaviour is specified by the defining equation (2) ....

....equivalence, is strictly more expressive than that obtained by augmenting BPA with the standard binary Kleene star. More precisely, it is proven ibidem that, in the presence of at least two actions, the process (a, a) # (a, b) cannot be expressed, modulo bisimulation equivalence, in ACP [4], and a fortiori in BPA, enriched with the binary Kleene star (cf. Lemma 3.2.3 in op. cit. Let us say that a term of the form (P 1 , Pm ) # (Q 1 , Q n ) has n exit iteration. By analogy with the aforementioned result from [5] it was proved in [1] that, in the presence of a ....

J. Baeten and W. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.

....such as a model checker or an interactive theorem prover. However, formal verification of communication protocols is notoriously difficult. Although a number of specification and verification techniques exist, including Hoare logic [11] temporal logic [15] automata [14] and process algebra [3], many of them have only been applied to toy examples. Even verification of a version of the Alternating Bit protocol [4] which is one of the simplest communication protocols) namely the bounded retransmission protocol (BRP) turned out to be nontrivial. The use of model checking for verification ....

J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.

....S such that each member of S admits a sequential and parallel decomposition over S. We disprove a conjecture of Schnoebelen concerning decomposable languages and establish some new properties of these languages. 1 Introduction The shu e product is a standard tool for modeling process algebras [2]. This motivates the study of robust classes of recognizable languages which are closed under shu e product. In [6] Schnoebelen introduced the notion of sequential and parallel decomposition (a precise de nition is given in Section 3) A language is decomposable if it belongs to a nite set ....

J. Baeten and W. Weijland, Process algebra, Cambridge Tract in Theoretical Computer Science vol. 18, Cambridge University Press, Cambridge UK, 1990.

....equality of terms. For every natural number n, we shall write [n] in lieu of 1, n . Apart from actions, the signature of the language BPA (A) includes the binary operations of alternative composition and sequential composition familiar from the theory of Basic Process Algebra [6, 4], and a variation on the original binary version of the Kleene star operation [9] that will be referred to as multi exit iteration. For positive integers m and n, the process term (P 1 , Pm ) # (Q 1 , Qn ) stands for an agent whose behaviour is specified by the following defining ....

....equivalence, is strictly more expressive than that obtained by augmenting BPA with the standard binary Kleene star. More precisely, it is proven ibidem that, in the presence of at least two actions, the process (a, a) # (a, b) cannot be expressed, modulo bisimulation equivalence, in ACP [4], and a fortiori in BPA, enriched with the binary Kleene star (cf. Lemma 3.2.3 in op. cit. Let us say that a term of the form (P 1 , Pm ) # (Q 1 , Qn ) has n exit iteration. By analogy with the aforementioned result from [5] it was proved in [1] that, in the presence of a ....

J. Baeten and W. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.

....or combinators as possible, each of which embodies some distinct and intuitive idea, and which together give completely general expressive power. The addition of a single recursive operation to the process algebraic framework ACP (Algebra of Communicating Processes) with abstraction ( BK85, BW90] provides general expressive power: each computable process can be expressed. We consider two candidates for such a recursive operation. The distinct and intuitive idea embodied by each of these is a simple way of counting. Rather than focusing on a particular machine model for computability ....

....candidates for such a recursive operation. The distinct and intuitive idea embodied by each of these is a simple way of counting. Rather than focusing on a particular machine model for computability we prove that standard processes as one finds in a text book on process theory ( Hoa85, Mil89, BW90] can be specified in a straightforward way. In [BBP94] we introduced Binary Kleene star, also called iteration, in process algebra. Binary Kleene star stems from Kleene [Kle56] and is in our notation defined by y) y: In our setting, register machine programming would be a natural ....

[Article contains additional citation context not shown here]

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

....where a term t 1 Delta t 2 represents the process that executes first t 1 and then t 2 . So the BNF grammar for BPA ffl is (with a 2 Act) t : a j ffl j t 1 t 2 j t 1 Delta t 2 : The intuition above for the operators in BPA ffl is formalized by the transition rules in Table 1 from [29], which constitute the TSS for BPA ffl . This TSS defines transitions t to express that term t can evolve into term t the execution of action a 2 Act, and transitions t to express that term t can terminate successfully. The variables x, x , y, and y in the transition rules range ....

....alternative composition than t and u. In a similar fashion it can be verified for the other transition rules of BPA ffl that S is a stratification. Hence, the TSS for BPA ffl is complete. 4 Conservative Extension Over and over again, process calculi such as CCS [158] CSP [187] and ACP [29] have been extended with new features, and the original TSSs, which provide the semantics for these process algebras, were extended with transition rules to describe these features; see, e.g. 28] for a systematic approach. A question that arises naturally is whether or not the LTSs associated ....

[Article contains additional citation context not shown here]

J. Baeten and P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.

....algebra. In this setting, a set of axioms can be applied to try and show that the term is behaviourally equivalent to, or in some other sense a suitable approximation of, the required specification. Indeed, one of the major schools of theoretical concurrency and its applications, that of ACP [21, 29], takes the notion of behavioural equivalence as primary, and defines operational semantics to fit its axioms. A logic of programs is complete (relative to a programming language) if all true formulas of the language are provable in the logic. As properties of interest are generally ....

J. Baeten, ed., Applications of Process Algebra, Cambridge Tracts in Theoretical Computer Science 17, Cambridge University Press, 1990.

....can be used to connect components and define the communication between them. This architecture resembles a hardware communication bus to which individual components can be connected. Communication between components only takes place over the bus and is formalized in terms of process algebra [4]. Likewise, component architectures such as CORBA [109] can be used. We have used the meta tooling presented in the previous sections in several projects. We will present a selection of our experiences. To start with, the meta tooling has been applied for its own development, and for the ....

J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

....the axioms for DIOA provide a method for directly proving fair trace inclusion. However, this is of limited use since almost any nontrivial I O automaton contains loops that have to be specified using recursion. Even our small example cannot be specified without using recursion. In ACP [BaW90] there is another approach to fairness by means of a rule called Koomen s Fair Abstraction Rule (KFAR) The basic idea for KFAR is that fairness issues can be reformulated in terms of divergences. Thus, a particular infinite execution can be avoided by making all of its actions internal. However, ....

J.C.M. Baeten and W.P Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990. Nancy Lynch and Roberto Segala

....of all processes. Our goal is to give formal speci cations of Internet applications for distributed consensus [4, 3] which comes as close to real life applications as possible. We therefore need to have a formalism to handle transactional processes. Since we have chosen to use process algebra [7] for the speci cation of Internet applications, we prefer modelling transactional behaviour of processes in process algebra. Although transactional behaviour can already be speci ed in process algebra with recursion (as will be proven in Section 6) introducing speci c transactional operators ....

....nishes then a equals 2. The example given in this section nicely shows the expressiveness of the transactional operator for de ning transactional behaviour. 4 Adding Transactions to Process Algebra Our starting point is an algebraic axiomatisation BPA (Basic Process Algebra) as described in [7]. The signature of BPA consists of action alphabet A , alternative composition operator and sequential composition operator . The axioms for BPA, A1 5, are given in Table 1. More information on degrees of isolation can be found in Section 7.2. a : 0 a : a 2) k (a : 1 a : a 2) ....

J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

....including systems with extremely large but finite state spaces, for which all other available techniques failed to provide answers. The framework we use for describing the behaviour of a system is process algebraic. We use the process algebraic language CRL [14, 16] which is an extension of ACP [3]; this language includes a formal treatment of data, as well as an operational and axiomatic semantics of process terms. Compared to CCS or ACP, the language CRL is more expressive. This is due to the presence of data. For our model checking algorithm, we assume that the processes are written in a ....

....quantifier free fragment of first order logic, whereas the logic we use in our approach employs the full first order logic. 2 Preliminaries Our main focus in this paper is on processes with data. As a framework, we use the process algebra CRL [14] Its basic constructs are along the lines of ACP [3] and CCS [23] though its syntax is influenced mainly by ACP. In the process algebra CRL, data is an integral part of the language, which makes the language more expressive than CCS or ACP (see discussion in [20] As we enforce no restrictions on data or on data types, we here introduce the more ....

[Article contains additional citation context not shown here]

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

.... with abstraction, processes can be composed by sequential composition, written P Delta Q, alternative composition, written P Q, parallel composition, written P k Q, encapsulation, written H (P ) and abstraction, written I (P ) For a systematic introduction to ACP, the reader is referred to [7]. We will use the following abbreviations. Let (P i ) i2I be an indexed set of process expressions where I = fi 1 ; i n g. Then, we write i2I P i for P i 1 : P i n and k i2I P i for P i 1 k : k P i n if n 0 and ffi if n = 0. Let P be a process expression and let n 2 N. ....

....of the variable x is exactly P . The behaviour of x:D P is a choice between the instances of P for the different values that x can take, i.e. the values from the data domain D. The above mentioned extensions of ACP with a state operator and a process creation mechanism are also presented in [7]. In ACP with abstraction, the operators S and E OE can be defined. Two objects are relevant to the semantics of SDL: the system being defined and its environment. These objects will be referred to by s and e, respectively. In [3] the definition of the state operator is adapted for ....

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.

....input pattern. Showing that this property holds for a given timed automaton A is an interesting problem, but we do not address this problem in this paper. In the untimed setting, bisimulation equivalences have been reasonably successful as notions of implementation between transition systems [BW90, Mil89]. Consequently, bisimulation equivalences have also been proposed as implementation relations for the timed setting [BB91, Klu93, MT90, NS94, Yi90] However, we do not believe that bisimulations will turn out to be very useful as implementation relations in the timed case. The problem is that ....

.... Algebra In this section, we give several examples of operations that can be expressed as action transducers; all these operations are directly inspired by operations from well known untimed process algebras such as CSP [Hoa85] CIRCAL [Mil85] CCS [Mil89] Extended LOTOS [Bri88] and ACP [BW90]. Our motivation for presenting these examples is twofold: first, they serve as an illustration of how familiar process algebraic operations can be defined using action transducers, and second, the resulting language L u will form the basis of a timed process algebra that we will define in Section ....

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

....in. The activity based approach cannot adequately provide different participants with varied abstracted processes. The activity based approach should be enhanced to provide different process abstractions. Several formal process modeling techniques, including process algebras and Petri Nets [1, 16, 18, 26], can provide process abstractions by renaming activities to silent activities that are not observable. Such abstraction is considered as partial abstraction since it provides partial observability of a process. Although useful in satisfying some of the needs of process abstractions, partial ....

....organizational roles. Notably, the term view used in some of above works represents an aspect of process modeling, while herein it represents a process abstraction. Several formal process modeling techniques include the notion of process abstraction, such as process algebras and Petri Nets [1, 16, 18, 26]. These models can define some activities as silent activities (also called activities) that are not observable. By renaming activities to silent activities, the desired abstraction can be obtained. In contrast, process views are derived through the bottom up aggregation of activities to ....

J. C. M. Baeten and W. P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18. Cambridge University Press, 1990.

....rules. This allows for rapid prototyping of the language. Moreover, based on the axiomatic system, there is an option for theorem proving. Examples of an axiomatic semantics are the pre and post conditions used for programming languages [10] or the use of axioms in the context of concurrency [1]. The semantics of the language are mostly defined on the abstract syntax representation. In case the language has a graphical syntax, its semantics can be defined directly on the graphical syntax, but it is often more convenient to define a mapping from the graphical syntax onto the abstract ....

J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

....the theory and the fundamental concepts of processes, non determinism, concurrency and behavioural equivalences. Moreover, process algebras are widely used for studying and performing algebraic veri cations. Many variants of process algebras have been developed, e.g. CCS [23] CSP [18] and ACP [5]. Without a means of expressing timing dependencies, their expressiveness is limited. However, many di erent timed extensions of process algebras have been proposed. The process algebra used in this paper is CRL t , which is a minor extension of CRL t [11] Data is an integral part of CRL t ....

....to be entities with an unlimited life span. Instead, the life span of a process is restricted by hard timing constraints. In some sense, this allows for more accurate representations of real life systems. Process algebras come in various variants, such as CCS [23] CSP [18] Lotos [7, 1] or ACP [5]. The process algebra employed in this paper is CRL t [11] and a minor extension thereof, called t . In this paper, we will restrict ourselves to presenting the syntax of CRL t and CRL t , and its operational semantics. The axioms are included in appendix A. 4.1 Data Types Unlike many ....

J. C. M. Baeten and W. P . Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

....topic. These relatively recent developments provide a new area of application for process algebras, having a history of being applied to discrete systems, such as (data) communications protocols. Within the theory of process algebras, various approaches exist, such as CCS [19] Lotos [15] and ACP [3]. Already a few case studies, in which process algebras have been used to describe a hybrid system, have been made (e.g. 1] and [11] In this article, the formalism timed CRL [9] is used to describe and analyse a hybrid system, consisting of a conveyor belt and its controller. The example is ....

J. C. M. Baeten and W. P . Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

....have become quite popular. On the one hand, theory in these formalisms is investigated and on the other hand, the theory is applied on case studies. In this paper, a process algebraic approach is investigated. Process algebras come in several variants (e.g. CSP [10] CCS [11] Lotos [4] ACP [3]) Application of process algebras in the domain of hybrid systems is not unprecedented (e.g. 8] 5] In this paper, the use of various techniques, originally developed for the untimed and timed variants of CRL [7] are shown in the context of hybrid systems. Most notably, the use of invariants ....

....describes the possibilities for analysis and veri cation. Section V concludes with some remarks, discusses ongoing research and hints at future research. II. Timed CRL The formalism CRL t [6] is a time extended variant of the process algebra CRL [7] which in turn is strongly rooted in ACP [3]. Unlike in ACP, in CRL and CRL t data is an integral part of the formalism. Much research has already been conducted in the area of untimed process algebras and nowadays, there also is a lot of information available on timed process algebras. The combination of time and data, however, has been ....

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

....Basic Petri Box Calculus We discuss a process algebra whose name Petri Box Calculus (PBC) arises from its original [6, 7] Petri net semantics. The PBC combines a number of features taken from other existing process algebras, notably COSY [26] CCS [31, 32] SCCS [32] T)CSP [25] and ACP [1]. But there are also some differences with each of these process algebras since PBC has been designed with two specific objectives in mind: to support a compositional Petri net semantics, together with an equivalent more syntaxoriented structured operational semantics (SOS) 39] and to ....

....is nothing like b t in CCS) While one might try to simulate the 3 way handshake using a series of binary handshakes, PBC proposes instead to extend the CCS framework so that a 3 way (and, in general, n way) synchronisation could be expressed. One possibility, which is akin to the ACP approach [1], might be to generalise the conjugation operation to a function or a relation that allows the grouping of more than just two actions; however, PBC takes a different approach, which is still based on considering primitive synchronisations to be binary in nature. This works through the usage of ....

J. Baeten, W.P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18 (1990).

....proved termination modulo AC of this system. As a second example we mention that the rewrite system of Example 4 is terminating modulo AC of the operator since for A an operation was chosen which is both commutative and associative. In fact this was the motivation of this rewrite system, see [8]. There the purpose was to prove completeness of the following equational axiomatization for bisimulation equivalence: x y = y x x (y z) x y) z x x = x (x y) z = x z) y z) x y) z = x (y z) x = x x = If such an equational system can be described ....

....pairs are joinable. Now the proof of completeness of the equational axiomatization can be given by proving that for the normal forms with respect to this TRS the notions of equivalence modulo AC and bisimulation equivalence coincide. A similar approach can be followed for various extensions ([8, 27]) this application of rewrite techniques can be considered as a standard approach for proving completeness of equational axiomatizations. In these two examples we saw that X Y and XY are suitable interpretations for AC operators since they obey both commutativity and associativity. On can ....

Baeten, J. C. M., and Weijland, W. P. Process Algebra, vol. 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

....rules. This allows for rapid prototyping of the language. Moreover, based on the axiomatic system, there is an option for theorem proving. Examples of an axiomatic semantics are the pre and post conditions used for programming languages [13] or the use of axioms in the context of concurrency [2]. The semantics of the language are mostly defined on the abstract syntax rep11 resentation. In case the language has a graphical syntax, its semantics can be defined directly on the graphical syntax, but it is often more convenient to define a mapping from the graphical syntax onto the abstract ....

....that for every program written in our language, this set can be computed at the start of the system. Below, the set NC and the multi sets of priorities, associated to each element in NC are listed. #, A , B , C , D , E , B, B, E , E # # # # # # # # # # [ 5] 5] 5] 3] [2] [5, 3] 5, 2] 5, 3] 5, 2] If we apply the extended priority function # to the elements in NC and use the multi set ordering we obtain the following ordering between these induced multi sets: 2] 3] 5] 5, 2] 5, 3] which is derived from the following chain: #(#) ....

[Article contains additional citation context not shown here]

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

No context found.

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge Tracts in Theoretical Computer Science 17. Cambridge University Press, 1990.

No context found.

J.C.M. Baeten and W.P. Weijland, Process algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press 1990.

No context found.

J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18, Cambridge University Press, Cambridge, 1990.

..... 66 C.3 Proofs of soundness and completeness of operational semantics . 69 C.4 Independence relation is compositional . 70 1 Introduction Process algebras [1, 19, 20, 22, 28] are widely used as models for the specification of concurrent systems, and so are Petri nets and their extensions [6, 21, 23, 32] In process algebra, emphasis tends to be on the study of algebraic properties of operators related to common constructs used in programming languages, such as ....

....procedure entry and procedure exits as separate (silent) actions. Thus, X = X essentially means that X is continually rewritten by itself and effects no behaviour at all, be it silent or observable. The literature is split over the treatment of such unboundedly recursive calls. For instance, [1] agrees with our interpretation; other authors advocate that X = X generates an infinite sequence of silent steps (modelling continuous entry to the procedure) and still other authors (such as [2] consider X = X to denote chaos , in the sense of generating all possible infinite sequences ....

[Article contains additional citation context not shown here]

J. Baeten, W.P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18 (1990).

....at which the preceding action is performed and time is measured on a discrete time scale. Measuring time on a discrete time scale means that time is divided into time slices and timing of actions is done with respect to the time slices in which they are performed. Roughly speaking, ACP is ACP [7, 6] extended with three operators to deal with timing: relative delay, relative time out, and relative initialization. The rst operator is a basic one and the latter two operators are useful auxiliary ones. has the following constants and operators: the undelayable action a, written a, is the ....

.... of silent steps, that I ( tf ( H (S b k K k L k R b ) is the solution of the guarded recursive speci cation that consists of the following equation: B = r 1 (d) s 2 (d) B : For more information on the silent step in the theory without timing, including details about CFAR, see [6]. We have obtained a guarded recursive speci cation 10 of a bu er with capacity one. Thus, we see that the PAR protocol is functionally correct. We want to stress that, in order to achieve this result, it was necessary to calculate rst the time dependent behavior of the whole protocol, because ....

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, Cambridge, 1990. 18

....methods have been developed by largely disjoint research communities, using different semantic models. The literature contains many examples of proofs using the two methods: some typical examples of simulation proofs appear in [LyT87, SLL93a, SLL93b] while examples of algebraic proofs appear in [Bae90, Jos92, OrP92] Supported by NSF grant CCR 89 15206, by DARPA contracts N00014 89 J 1988 and N00014 92 J 4033, and by ONR contract N00014 91 J 1046. Correspondence and offprint requests to: Nancy Lynch and Roberto Segala In this paper, we unify, evaluate and compare the simulation based and ....

....no way to use an action based representation method in process algebras. Moreover, the pure DIOA calculus does not provide tools to deal with structured states. A standard technique to deal with structured states within process algebras makes use of parameterized process variables [Hoa85, Mil89, Bae90] For example, a counter can be represented by a process variable X parameterized over a natural number n in the following way: X 0 = up : X 1 = down : Xn Gamma1 up : Xn 1 if n 0: Such a technique is generally used when the size of a system is large [Bae90, OrP92] since a specification ....

[Article contains additional citation context not shown here]

J.C.M. Baeten. Applications of Process Algebra. Cambridge Tracts in Theoretical Computer Science 17, Cambridge University Press, 1990.

....which we propose to extend by adding operations allowing large high level nets to be composed from smaller parts in a modular way. They include operations such as sequential and parallel composition, transition synchronisation and restriction (and others) similar to a process algebraic setup [1, 20, 29, 30]. The way we define these operations is by using a further function from places and transitions to suitable objects. To distinguish them from annotations, we call these other objects labels . This name is appropriate because the special case of elementary M nets corresponds to what is widely ....

Jos C.M. Baeten and W. P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18 (1990).

....conditions. The must test cases are usually more general than the specification that is to be tested, and as such no deadlock may occur when run in parallel with a specification. The following example will clarify the distinction between these two classes of test cases. The example is taken from [BW90] and although there it is used to show the difference between two processes, it can also be used to show the difference between the two classes of test cases. Example The example describes the following situation: you find yourself in a building with two elevators, one of which is perfectly ....

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

No context found.

J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 18(1), 1990.

No context found.

J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 18(1), 1990.

No context found.

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

No context found.

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

No context found.

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

No context found.

J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

No context found.

J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

No context found.

J. BAETEN AND P. WEIJLAND, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.

No context found.

J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 1990.

No context found.

J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol. 18, Cambridge University Press, 1990.

No context found.

J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 1990.

No context found.

J.C.M. Baeten and W.P. Weijland. Process Algebra. No. 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

No context found.

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge tracts in theoretical computer science 18, Cambridge University Press, 1990.

No context found.

J. C. M. Baeten, W. P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1990.

No context found.

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

No context found.

J.C.M Baeten and W.P Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, volume 18. Cambridge University Press, 1990.

No context found.

J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.

No context found.

J. Baeten and P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science, Vol. 18. Cambridge Univ. Press, Cambridge, 1991.

No context found.

J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

No context found.

J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science, 18, 1990.

No context found.

J. Baeten and W. Weijland, Process algebra, Cambridge Tract in Theoretical Computer Science vol. 18, Cambridge University Press, Cambridge UK, 1990. 31

First 50 documents  Next 50

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