| J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge University Press 1990. |
....(preferably finite) set of behaviorally representative arrangements, which could then each be verified. To be useful, the discovery and application of such reductions must follow a systematic approach. Much work has already been done in several communities on discovery of such relationships (e.g. [7, 2, 22]) in the remainder of this paper, we presume such results and develop a reduction strategy based upon an algebraic term rewriting technique that is immediately applicable to a wide range of network application structures. It is important to note that a number of techniques have been developed ....
.... that the behaviors of members of # are fully represented by the behaviors of members of its subsetf (A # ) The means by which this behavioral equivalence is established may be any mechanism appropriate to the given application and # (e.g. logical proofs, type systems [7] process algebra [2], theory of I O automata [22] I O equivalence, etc. 3.4 Reduction Strategy Intuitively, our strategy is to identify a set of reductions (i.e. congruence relations overA which preserve behavioral equivalence) by which we can establish a finite sized homomorphic image ofA (that is, a ....
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge University Press, 1990.
....(preferably finite) set of behaviorally representative arrangements, which could then each be verified. To be useful, the discovery and application of such reductions must follow a systematic approach. Much work has already been done in several communities on discovery of such relationships (e.g. [7, 2, 22]) in the remainder of this paper, we presume such results and develop a reduction strategy based upon an algebraic term rewriting technique that is immediately applicable to a wide range of network application structures. It is important to note that a number of techniques have been developed ....
.... the behaviors of members of set # are fully represented by the behaviors of members of its subset f(A # ) The means by which this behavioral equivalence is established may be any mechanism appropriate to the given application and # (e.g. logical proofs, type systems [7] process algebra [2], theory of I O automata [22] I O equivalence, etc. 3.4 Reduction Strategy Intuitively, our strategy is to identify a set of reductions (i.e. congruence relations over which preserve behavioral equivalence) by which we can establish a finite sized homomorphic image of (that is, a ....
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge University Press, 1990.
.... process theory, which ranges from concurrency semantics in which models for concurrent or parallel (nondeterministic) programming are investigated (e.g. Win82] IBM88] vG90] to process algebra, in which one tries to give an algebraic calculus for this kind of programming ( MilS0] BK86] [BW90]) In these algebraic calculi (or process algebras, as they are usually called) one is actually interested in calculating equivalences of processes on the basis of certain observational criteria: if two processes are indistinguishable with respect to some observational criterion, they are regarded ....
J.C.M. Baeten & W.P. Weijland, Process Algebra, Cambridge University Press, 1990.
.... process theory, which ranges from concurrency semantics in which models for concurrent or parallel (nondeterministic) programming are investigated (e.g. Win82] BM88] vG90] to process algebra, in which one tries to give an algebraic calculus for this kind of programming ( Mi180] BK86] [BW90]) In these algebraic calculi (or process algebras, as they are usually called) one is actually interested in calculating equivalences of processes on the basis of certain observational criteria: if two processes are indistinguishable with respect to some observational criterion, they are regarded ....
J.C.M. Baeten & W.P. Weijland, Process Algebra, Cambridge University Press, 1990.
No context found.
J.C.M. Baeten, W.P. Weijland, Process algebra, Cambridge University Press, 1990.
No context found.
J.C.M. Baeten, W. P. Weijland, Process algebra, Cambridge University Press, 1990.
No context found.
J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge University Press 1990.
No context found.
Baeten J.C.M.,W.P. Weijland. Process Algebra. Cambridge University Press, 1990.
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge University Press, 1990.
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990.
No context found.
Baeten, J.C.M. and Weijland, W.P. Process Algebra. Cambridge University Press, 1990.
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990. 34
No context found.
J.C.M. Baeten and W.P. Weijland, Process Algebra, Cambridge University Press, Cambridge, 1990
No context found.
J. C. M. Baeten. Process Algebra. Cambridge University Press, 1990.
No context found.
J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge University Press, Cambridge, 1990.
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge University Press, 1990.
No context found.
Baeten, J.C.M. and Weijland, W.P. Process Algebra. Cambridge University Press, 1990.
No context found.
Baeten J.C.M.,W.P. Weijland. Process Algebra. Cambridge University Press, 1990.
No context found.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge University Press, Cambridge, 1990.
No context found.
Baeten J.C.M.,W.P. Weijland. Process Algebra. Cambridge University Press, 1990.
No context found.
J. Baeten and W. Weijland. Process algebra. Cambridge University Press, 1990.
No context found.
J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge University Press 1990.
No context found.
J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge University Press, Cambridge, 1990.
No context found.
Baeten, J.C.M. and Weijland, W.P. Process Algebra. Cambridge University Press, 1990.
No context found.
J.C.M. Baeten & W.P. Weijland, Process Algebra, Cambridge University Press, 1990.
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