R. Gorrieri and C. Laneve. Split- and ST-Semantics for CCS. In MFCS'91, LNCS 520, pp. 170-180,1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Process Algebra for Limited Parallelism - Gruska (Correct)
....But in the literature they are known only two approaches. It is supposed that processes have at disposal as many resources as they need (full parallelism) or they have just one resource processor at disposal. For example, a duration model of CCS where each action is split to n phases (see [GL91]) and these phases can be interleaved but they cannot be executed at the same moment. In the presented language we can model both these extreme cases by putting m in km (P ) to a number of processes in P and by putting all processes to the same level (without distribution) and m = 1. ....
R. Gorrieri and C. Laneve. Split- and ST-Semantics for CCS. In MFCS'91, LNCS 520, pp. 170-180, Springer Verlag, Berlin,1991.
Shared Processors versus Shared Networks - Gruska (Correct)
....is split to several phases then this time is given as a sum of durations of all these phases. Roughly speaking their idea how to express duration of actions is to split every action to several phases, for simplicity, to two phases, its starting and its finishing phase (this idea is developed in [5]) Technically it is realized with the help of an action refinement (see [3, 4] i.e. by the mapping r : u 7 u s :u f . Processes P; Q are defined to be split equivalent if r(P ) r(Q) are interleaving equivalent. Then processes P = a:N il j b:N il and Q = a:b:N il b:a:N il are not split ....
....process and the second one is the current value of the global clock. The phases which 7 must synchronize are postfixed by a superscript showing the clock value of the time at which the corresponding action started. Therefore, only phases postfixed by the same clock value can be synchronized (see [5] for details and proofs) Let Act 2 = Act (s) Act (f) where Act (i) fu i ; u 2 Actg for i 2 fs; fg be the set of action phases. We distinguish the various phases of an action by indexing the action itself with the corresponding subscripts. The set Act 2 of labels of the transition ....
R. Gorrieri and C. Laneve. Split- and ST-Semantics for CCS. In MFCS'91, LNCS 520, pp. 170-180,1991.
Bounded Concurrency - Gruska (Correct)
....done either on syntactical or semantical levels. In both cases they got the same non interleaving semantics (i.e. distinguishing between a j b and a:b b:a) moreover finer than the original bisimulation. Later L. Aceto in his monograph [A92] extended those results to other equivalences and in [GL91] a hierarchy of semantics given by splitting to more phases was presented. In general this approach is based on the assumption that processes can exploit just one execution unit. Another extreme, that of unbounded concurrency was studied in [Gru92] In this case a technique of auxiliary time ....
R. Gorrieri and C. Laneve. Split- and ST-Semantics for CCS. In MFCS'91, LNCS 520, pp. 170-180, 1991.
Shared Processors versus Shared Networks - Gruska (Correct)
No context found.
R. Gorrieri and C. Laneve. Split- and ST-Semantics for CCS. In MFCS'91, LNCS 520, pp. 170-180,1991.
Timed Process Description Languages Based on CCS - GRUSKA, MAGGIOLO-SCHETTINI (1991) (Correct)
No context found.
R. Gorrieri and C. Laneve. Split- and ST-Semantics for CCS. In MFCS'91, LNCS 520, pp. 170-180,1991.
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