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 |
This paper is cited in the following contexts:
First 50 documents Next 50
A Note on an Expressiveness Hierarchy - For Multi-Exit Iteration (Correct)
....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.
Process Algebra with Language Matching - Jos Van Wamel Self-citation (Algebra) (Correct)
No context found.
J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge Tracts in Theoretical Computer Science 17. Cambridge University Press, 1990.
Process Algebra with Feedback - Baeten Bergstra Gh Self-citation (Baeten Algebra) (Correct)
No context found.
J.C.M. Baeten and W.P. Weijland, Process algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press 1990.
Real Time Process Algebra With Time-Dependent Conditions - Baeten, Middelburg (2001) Self-citation (Baeten Algebra) (Correct)
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.
Knowledge, State, Event and Time in System Modeling -.. - Dong, Duke, Sun (2006) (Correct)
No context found.
J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 18(1), 1990.
Generating MSCs from an Integrated Formal - Specification Language Jin (Correct)
No context found.
J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 18(1), 1990.
Two Finite Specifications of a Queue Marc Bezem - Alban Ponse Utrecht (Correct)
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
Process Algebra with Language Matching - Jos Van Wamel (Correct)
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
Frame Algebra with Synchronous Communication - Jan Bergstra Alban (Correct)
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
The Algebra of - Finite State Processes (Correct)
No context found.
J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
The Algebra of - Finite State Processes (Correct)
No context found.
J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
Split-2 Bisimilarity has a Finite Axiomatization over CCS with.. - Aceto, al. (2004) (Correct)
No context found.
J. BAETEN AND P. WEIJLAND, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.
An Automata-theoretic Approach to Interprocedural Data-flow.. - Esparza, Knoop (1999) (27 citations) (Correct)
No context found.
J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 1990.
Grammars as Processes - Esparza (2002) (2 citations) (Correct)
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.
Efficient Algorithms for pre* and post* on Interprocedural.. - Esparza, Podelski (2000) (Correct)
No context found.
J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 1990.
Model Checking Probabilistic Pushdown Automata - Esparza, Kucera, Mayr (2004) (1 citation) (Correct)
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.
The Concurrency Column - Aceto (Correct)
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge tracts in theoretical computer science 18, Cambridge University Press, 1990.
Precise Interprocedural Dependence Analysis of Parallel Programs - Müller-Olm (2004) (Correct)
No context found.
J. C. M. Baeten, W. P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1990.
Studies in Computer Aided Verification of Protocols - Griffioen (2000) (Correct)
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
Finite Axiom Systems for Testing Preorder and De Simone Process.. - Ulidowski (1996) (1 citation) (Correct)
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.
Formal Verification of an Improved Sliding Window Protocol - Chkliaev, Hooman, de Vink (2002) (Correct)
No context found.
J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.
Large State Space Visualization - Jan Friso Groote (2003) (1 citation) (Correct)
No context found.
J. Baeten and P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science, Vol. 18. Cambridge Univ. Press, Cambridge, 1991.
Process Algebra Primitives for File Transfer - Jan Bergstra Alban (1 citation) (Correct)
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
Model Checking for Open Systems: A Compositional Approach to.. - Andrade-Gomez (2001) (Correct)
No context found.
J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science, 18, 1990.
Shue on Positive Varieties of Languages. - Antonio Cano Omez (Correct)
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