J.C.M. Baeten and J.A. Bergstra, Process algebra with a zero object, in: Proc. CONCUR'90, Amsterdam (J.C.M. Baeten and J.W. Klop, eds.), LNCS 458, Springer-Verlag, 1990, pp. 83-98. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Congruence Theorem for Structured Operational Semantics With.. - Verhoef (1993) (106 citations) (Correct)
....is a congruence with the aid of their congruence theorem for strong bisimulation. We leave it as an open problem whether a similar trick can also be applied for the CCS like process algebra of Aceto and Hennessy. Especially when only the negated predicate is important. See, for instance, [3] or [7] a a Gamma p x a Gamma x 0 xy a Gamma x 0 y x oe Gamma x 0 xy oe Gamma x 0 y x a Gamma p xy a Gamma y oe d (x) oe Gamma x x a Gamma x 0 x y a Gamma x 0 a Gammay x x a Gamma p x y a Gamma p a Gammay x x oe Gamma x 0 ....
J. C. M. Baeten, J. A. Bergstra, Process algebra with a zero object, in: J. C. M. Baeten and J. W. Klop, editors, Proceedings CONCUR 90, Amsterdam, LNCS 458, pp. 83--98, Springer-Verlag, 1990.
A Congruence Theorem for Structured Operational Semantics.. - Baeten, Verhoef (1993) (106 citations) (Correct)
....y a Gamma p x a Gamma p x a Gamma y; y Gamma x 0 x a Gamma x 0 x a Gamma y; y Gamma p x a Gamma p Table 6. Operational rules for the silent step. The next example is an operational semantics of the language BPA 0 that originates from Baeten and Bergstra [3]. The theory BPA 0 is the language BPA (that we already saw above) with a zero object denoted by 0. They have for this constant the following laws x 0 = x; x0 = 0; 0x = 0: Baeten and Bergstra explicitly state in their paper: We cannot define action rules in the format of Groote and Vaandrager ....
....language BPA (that we already saw above) with a zero object denoted by 0. They have for this constant the following laws x 0 = x; x0 = 0; 0x = 0: Baeten and Bergstra explicitly state in their paper: We cannot define action rules in the format of Groote and Vaandrager [16] or Groote [15] see [3], loc. cit. p. 87) The problems arise with the rules for the sequential composition: if x a Gamma x 0 then we will only have xy a Gamma x 0 y if y 6= 0. In table 7 we give the rules that define the (postfix) predicate Delta 6= 0 and we give the rules for the sequential composition. ....
J. C. M. Baeten, J. A. Bergstra, Process algebra with a zero object, in: J. C. M. Baeten and J. W. Klop, editors, Proceedings CONCUR 90, Amsterdam, LNCS 458, pp. 83--98, Springer-Verlag, 1990.
Process Algebra with Feedback - Baeten Bergstra Gh Self-citation (Baeten Bergstra) (Correct)
No context found.
J.C.M. Baeten and J.A. Bergstra, Process algebra with a zero object, in: Proc. CONCUR'90, Amsterdam (J.C.M. Baeten and J.W. Klop, eds.), LNCS 458, Springer-Verlag, 1990, pp. 83-98.
Basic Multi-Competence Programming - Bergstra, Bethke, Ponse (2000) Self-citation (Bergstra) (Correct)
No context found.
J.C.M. Baeten and J.A. Bergstra. Process algebra with zero a object (revised version of P9002).
Discrete-Time Process Algebra with Empty Process - Baeten, Vereijken (1997) Self-citation (Baeten) (Correct)
....behavior. For example, a very broad class of deadlock like processes has been described in the literature. To name a few variants (in order of increasing degree of catastrophe) classic (#, see [13] immediate ( #,see [7, 8] should not be here (#, see [6] and true zero (0, see [2]) A similar observation holds for the implementation of the concept choice : half a dozen versions, ranging from completely deterministic to completely non deterministic have been described. It appears that the concept empty process is different; it leaves little room for differing ....
J.C.M.BAETEN AND J. A. BERGSTRA. Process algebra with a zero object.In[10],pages 83--98, 1990.
Discrete-Time Process Algebra with Empty Process - Baeten, Vereijken (1997) Self-citation (Baeten) (Correct)
....behavior. For example, a very broad class of deadlock like processes has been described in the literature. To name a few variants (in order of increasing degree of catastrophe) classic (#, see [13] immediate ( #, see [7, 8] should not be here (#, see [6] and true zero (0, see [2]) A similar observation holds for the implementation of the concept choice : half a dozen versions, ranging from completely deterministic to completely non deterministic have been described. It appears that the concept empty process is different; it leaves little room for differing ....
J. C. M. BAETEN AND J. A. BERGSTRA. Process algebra with a zero object. In [10], pages 83--98, 1990.
Process Algebra with Feedback - Baeten, Bergstra, Stefanescu (2 citations) Self-citation (Baeten Bergstra) (Correct)
.... determination of the interaction of all the special constants: ffi (inaction, BeK84] nil (CCS termination [Mil89] AcH92] ffl (termi Process Algebra with Feedback 22 nation option [Vra91] silent step [Mil89] Delta (divergence [AcH92] chaos [BrHR84] 0 (zero process [BaB90]) X Y = Y X (X Y ) Z = X (Y Z) X X = X (X Y ) Delta Z = X Delta Z Y Delta Z (X Delta Y ) Delta Z = X Delta (Y Delta Z) X ; X a ffi = a ; Delta X = ffi Delta X = ffi X Delta ; X Delta ffi a j b = fl(a; b) if fl(a; b) defined a j b = ffi otherwise X k Y = X ....
J.C.M. Baeten and J.A. Bergstra, Process algebra with a zero object, in: Proc. CONCUR'90, Amsterdam (J.C.M. Baeten and J.W. Klop, eds.), LNCS 458, Springer-Verlag, 1990, pp. 83-98.
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