Glynn Winskel. Event structure semantics for CCS and related languages. In Proceedings of 9th ICALP, volume 140 of LNCS, pages 561--576. Springer, 1982.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....parallel (and nondeterministic) execution is catered for. In fact, there is a whole branch of theoretical computer science dealing with so called 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 ....

G. Winskel, Event Structure Semantics for CCS and Related Languages, in: Proc. 9th ICALP, Aarhus (M. Nielsen & E.M. Schmidt, eds.), Lect. Notes in Comp. Sc. 140, Springer- Verlag, Berlin, 1982, pp. 561-576.

....the process a.0 b.0 could be associated with the left Petri net of Figure 1.4. For examples see Olderog [130] and the references therein. Such semantics at least in principle furnishes the way for applying the models of behaviour associated with Petri nets. Alternatively, Winskel shows in [169] how to give an event structure semantics for CCS without going through a Petri net semantics. Another approach is to augment the operational semantics with some extra intensional information allowing to observe causal dependencies or spatial distribution, see e.g. Aceto [6] Boudol et al. 21, ....

G. Winskel. Event structure semantics for CCS and related languages. In M. Nielsen and E. M. Schmidt, editors, Proceedings 9 th ICALP, Aarhus, volume 140 of Lecture Notes in Computer Science, pages 561--576. Springer-Verlag,

....to a most general parallel composition in which all conceivable synchronisations and non synchronisations are allowed. The usual parallel operators of e.g. CCS and TCSP can be derived by such a parallel composition followed by a restriction and relabelling (reflecting a synchronisation algebra [138, 141]) Being just particular labelled transition systems, the above definition of morphisms obviously restricts to labelled trees, making the model of synchronisation trees into a full subcategory of TS which we denote by ST. The inclusion ST ## TS is in fact a left adjoint to a functor unf : TS ....

Glynn Winskel. Event structure semantics of ccs and related languages. In Mogens Nielsen and Erik M. Schmidt, editors, Icalp '82, volume 140 of LNCS, pages 561--576.

....1 ) and (g 1 (30) leak 2 ) The conflict relation will contain elements of the form (disaster 1 ,leakOff 1 ) Product of Hybrid Systems One of the uses of event structures is to give a denotational semantics to an appropriate parallel language such as CCS. This has been shown by Winskel in [12]. While we are not aware of any language for expressing hybrid systems (most are expressed directly as automata) we could easily define a semantics for sequencing, choice, parallel product etc. This would follow the standard technique used in [13] and is not presented here. We do present a ....

G. Winskel. Event structure semantics for CCS and related languages. In ICALP-82, LNCS 140, pages 561--567. Springer Verlag, 1982.

....structures. As the first, basic, structure we have chosen event structures. We use a subset of CCSP expressions to write down examples of concurrent systems in a concise and intuitive manner, assuming event structures as a semantics. An event structure semantics of CCSP can be found in, e.g. Wi82, LG91] 2.1 Event Structures Event structures represent a concurrent system by taking occurrences of actions as the starting point. Every occurrence of an action is modelled as a separate event; a label function indicates which action is represented. Two relations are provided that capture, ....

: Winskel, G., Event Structure Semantics for CCS and Related Languages, Proc. of ICALP, LNCS 224, 1982.

.... to write modular and expressive programs, and to model systems equipped with synchronization primitives (to achieve modularity in de ning the net associated to the synchronous composition of two programs, the translations presented in the literature involve complex, and often ad hoc, constructions [48,26,36,20,28,7]) Besides transitions and ordinary places (here called stable places) zs nets include a distinguished set of zero places for modeling idealized resources that remain invisible to external observers, whilst stable markings, which just consist of tokens in stable places, de ne the observable ....

G. Winskel. Event structure semantics of CCS and related languages. In M. Nielsen and E. Meineche Schmidt, editors, Proceedings ICALP'82, volume 140 of Lect. Notes in Comput. Sci., pages 561-567. Springer Verlag, 1982.

.... more expressive than prime event structures, i.e. there do exist bundle event structures for which there does not exist a prime event structure with the same set of configurations (and not the reverse) A comparison of the expressive power of bundle event structures compared to Winskel s stable [40] and Boudol and Castellani s flow event structures [14] is given in [26] 3 In bundle event structures, 7 is a relation between a set of events that are in mutual conflict and an event. The conflict relation is irreflexive, but not required to be symmetric. It is denoted by ; and depicted by a ....

....a system run, then it is for each bundle X 7 e uniquely determined which event in X has caused e. If constraint (P1) is omitted, several interpretations turn out to be plausible with different characteristics [28] The constraint is similar to the stability constraint in stable event structures [40]. ffl Constraint (P2) enforces that as soon as e is enabled either e 0 is also enabled (provided e 0 is not disabled in some way) or as soon as e 0 occurs e will be permanently disabled, since some bundle pointing to e is disabled by e 0 . Pictorially for the case e 0 ; e: implies X ....

G. Winskel. Event structure semantics for CCS and related languages. In Automata, Languages and Programming --- ICALP'82, LNCS 140, pages 561-- 576. Springer-Verlag, 1982.

....80] processes are modelled in terms of events which represent information passing acts. This is reflected in the original semantics of CCS, where processes are represented by so called synchronization trees, and in the more sophisticated semantics that has been developed by Winskel, Wins 82] Wins 83] Wins 87] where processes are represented by so called labelled event structures. In this paper we propose a new calculus in which processes are modelled in terms of data rather than events. We represent processes by structures which are similar to labelled event structures, but which denote ....

....in H a prefix g of h that separates x and y in the sense that either x 2 X g and not y 2 X g or not x 2 X g and y 2 X g , 6) H is said to be finitary iff each h 2 H is the supremum of a set of finite f 2 H . 2 The following proposition is an analogue of a result of Winskel (cf. Wins 82] and [Wins 83] 2.9. Proposition. Let a set H of feasible histories be nonempty and finitely compatible in the set of feasible histories. For h 2 H let notafter H;h denote the following relation on X h : x notafterH;h y iff y 2 X g implies x 2 X g for all g 2 H such that g h and for y 2 X h let ....

Winskel, G., Event Structure Semantics for CCS and Related Languages, Aarhus University, DAIMI PB-159, April 1983 38

....kl. III. Oddano do druku w czerwcu 1999 r. Wydawnictwo IPI PAN ISSN: 0138 0648 2 Abstract. Streszczenie An algebra of processes is proposed in which processes are modelled in terms of data rather than events. Structures representing processes are similar to the labelled event structures of Winskel (1982), but they denote flows of data. For processes represented in such a way operations similar to those of CCS (the Calculus of Communicating Systems as developed by Milner (1980) are defined and their fundamental properties are stated. ALGEBRA PRZEP LYW OW DANYCH Praca zawiera propozycje ....

....Milner (1980) are defined and their fundamental properties are stated. ALGEBRA PRZEP LYW OW DANYCH Praca zawiera propozycje pewnej algebry proces ow, w kt orej procesy opisuje sie za pomoca danych a nie zdarze n. Struktury reprezentujace procesy przypominaj a etykietowane struktury zdarze n Winskela (1982), ale opisuja one przep lywy danych. Na procesach tak reprezentowanych definiuje sie operacje, podobne do operacji zaproponowanego przez Milnera (1980) rachunku komunikujacych sie system ow CCS. Key words: reactive system, process, history, prefix order, flow of data, approximation order, sum, ....

[Article contains additional citation context not shown here]

Winskel, G., Event Structure Semantics for CCS and Related Languages, in: M. Nielsen and E. M. Schmidt, eds., Lecture Notes in Comp. Sc. 140, Springer, Berlin, 1982

.... by the correspondence x 7 Gamma label(x) An equivalent model of a behaviour can be obtained by considering the family of configurations of a representing event structure E, where a configuration is a finite conflictfree prefix of E or, more precisely, the set of events of such a prefix (cf. 9] [10], and [11] Such a family, conf(E) is a member of an axiomatically defined class of structures 4 (prime configuration structures) Namely, it is closed w.r. to intersections of nonempty subfamilies and unions of subfamilies which have upper bounds in conf(E) Conversely, each family P of sets ....

G. WINSKEL, Event Structure Semantics for CCS and Related Languages, Aarhus University, DAIMI PB-159, April 1983

.... by the correspondence x 7 Gamma label(x) An equivalent model of a behaviour can be obtained by considering the family of configurations of a representing event structure E, where a configuration is a finite conflictfree prefix of E or, more precisely, the set of events of such a prefix (cf. [9], 10] and [11] Such a family, conf(E) is a member of an axiomatically defined class of structures 4 (prime configuration structures) Namely, it is closed w.r. to intersections of nonempty subfamilies and unions of subfamilies which have upper bounds in conf(E) Conversely, each family P of ....

....a slightly more general concept of configuration structures which we obtain by replacing the condition of closedness w.r. to intersections of nonempty subfamilies of configurations by a weaker condition of closedness w.r. to intersections of nonempty bounded subfamilies (stability in the sense of [9]) In this case, for a configuration structure P , each x 2 S P may identify an event only locally (within a configuration) and instead of a global causal quasiorder we obtain a consistent family ( p : p 2 P ) of local quasiorders, where x p y iff x; y 2 p and y 2 q implies x 2 q for all q p ....

[Article contains additional citation context not shown here]

G. WINSKEL, Event Structure Semantics for CCS and Related Languages, Springer LNCS 140, 1982, pp.561-576

.... and the weight ae(x) jxj where jxj means the usual length of a string x) Chapter 1: Basic definitions 16 ffl trees of finite heigth endowed with Winskel s partial order [Win84] and height as underlying weight and ffl prime event structures of finite depth with Winskel s partial order [Win82] and the depth as underlying weight. Mazurkiewicz traces [Maz89] yield an example for a length which is not a weight. 5 Given a length ae on a pointed poset (D; v) we are interested to carry over this concept to Ch(D) and Idl(D) Here we use the set P # (D) as common platform. Let (D; v) be a ....

Glynn Winskel. Event structure semantics for CCS and related languages. In Proceedings of ICALP 82, volume 140 of Lecture Notes in Computer Science, pages 561--676. Springer, 1982.

....event structure E over M is a quadruple E = hE; #; i where hE; #i is the underlying event structure, also referred to as E , E M is the labelling function. Labelled event structures have been used as the semantic domain to provide denominational semantics to languages like CCS, cf. Winskel 82] Let E = hE; #; i be a labelled event structure. A labelling : E M of events of E is deterministic, provided for any e and e 0 the following holds (e) e 0 ) 9 C)C e Gamma C e 0 Gamma implies e = e 0 : In this case also the labelled event structure is called ....

....Do we have the same picture for concurrent systems as well In this Section we try to find it out. 4. 1 Back and Forth Bisimulation on Event Structures The idea of unfolding provides the basic rationale for accepting event structures as denotations of system behaviour, cf [Nielsen et al. 81, Winskel 82] The forward flow of time is hidden in the fabrics of the event structures, just as it was in trees. Thus, it is only natural to repeat the question: Does the backward part of the back and forth bisimulation make any impact in the realm of event structures But, let us first rephrase the notion ....

Winskel, G. Event Structures Semantics for CCS and Related Languages. Lecture Notes in Computer Science 140, Springer-Verlag, 1982.

....Comunicazione; by Esprit Working Groups CONFER2 and COORDINA; and by MURST project Tecniche Formali per Sistemi Software. this model offers a basic concurrent framework that has often been used as a semantic foundation for system analysis and for the interpretation of many concurrent languages [30, 14, 24, 11, 16, 3]. However, though net transitions allow for token synchronization, the basic net model does not offer any synchronization mechanism among transitions, while this feature is essential to write modular and expressive programs, and to model systems equipped with synchronization primitives. In fact, ....

G. Winskel, Event structure semantics of CCS and related languages, in: M. Nielsen and E. Meineche Schmidt, Eds., Proceedings ICALP'82, LNCS 140, 561--567, Springer-Verlag (1982).

....: 52 Introduction Petri nets (Reisig 1985) are unanimously considered as one of the most attractive models of concurrency. As a matter of fact, this model offers a basic concurrent framework that has often been used as a semantic foundation on which to interpret many concurrent languages (Winskel 1982; Van Glabbeek and Vaandrager 1987; Olderog 1987; Degano et al. 1988; Gorrieri and Montanari 1995; Best et al. 1992) However, though net transitions allow for token synchronization, the basic net model does not offer any synchronization mechanism among transitions, while this feature is essential ....

Winskel, G. (1982), Event Structure Semantics of CCS and Related Languages, in "Proceedings of ICALP'82", LNCS 140, 561--567, Springer-Verlag.

....1 Introduction Petri nets [18,17] are unanimously considered one of the most attractive models of concurrency. As a matter of fact, this model ooeers a basic concurrent framework that has often been used as a semantic foundation on which to interpret concurrent languages (see for instance [19,10,16,5,8,2]) However the basic net model does not ooeer any synchronization mechanism among transitions, while this feature is essential to write modular, expressive programs. Thus all the above translations involve complex constructions for the net de ning the synchronized composition of two programs. In ....

G. Winskel. Event Structure Semantics of CCS and Related Languages. In Proceedings of ICALP `82, LNCS, n. 140, pages 561567, Springer-Verlag, 1982.

....a c b and b c , and Q has maximal elements a d and a b c . Then P and Q are order isomorphic; for instance the following mappings induce an order isomorhpism g: a 7 b ; b 7 a ; a c 7 b c ; b c 7 a d : Event morphisms are inspired by the family of configuration morphisms defined in e.g. [24, 26]. If f : P Q is an event morphism then P can also simulate an initial part of the behaviour described by Q, but such that different events in a given run of P correspond to different events in Q and vice versa. P may be able to do events that fall outside the scope of Q, since f is a partial ....

G. Winskel. Event structure semantics for CCS and related languages. In M. Nielsen and E. M. Schmidt, editors, Automata, Languages and Programming, volume 140 of Lecture Notes in Computer Science, pages 561--576. Springer-Verlag, 1982.

....[Pet73, Rei85] are a widely used model of concurrency. This model is attractive from a theoretical point of view because of its simplicity and because of its intrinsically concurrent nature, and has often been used as a semantic basis on which to interpret concurrent languages (see for example [Win82, Old87, vGV87, DDM88]) For Place Transition (PT) nets, having a satisfactory semantics one that does justice to their truly concurrent nature, yet is abstract enough remains in our view an unresolved problem. Certainly, many different semantics have been proposed in the literature; we briefly discuss some of them ....

G. Winskel. Event Structure Semantics for CCS and related languages. In proceedings of the 9th ICALP, LNCS, n. 140, pp. 561--576, Springer-Verlag, 1982.

No context found.

Glynn Winskel. Event structure semantics for CCS and related languages. In Proceedings of 9th ICALP, volume 140 of LNCS, pages 561--576. Springer, 1982.

....# L # L # 0 (a) # 1 (a) #= 0 determined by the 0 element, and r : D # L is the relabelling, given by r(a) # 0 (a) # 1 (a) for a # D. We present one synchronisation algebra as an example, in the form of tables more, including those for value passing, can be found in (Winskel 1982; Winskel 1985) Example: The synchronisation algebra for pure CCS: In CCS (Milner 1989) events are labelled by a, b, or by their complementary labels a, b, or by the label # . The idea is that only two events bearing complementary labels may synchronise to form a synchronisation event ....

Winskel, G. (1982). Event structure semantics of CCS and related languages.

No context found.

: Winskel, G., Event Structure Semantics for CCS and Related Languages, Proc. of ICALP, LNCS 224, 1982.

No context found.

G. Winskel. Event structure semantics for CCS and related languages. In Proc. of 9th ICALP, pages 561--576. SpringerVerlag, LNCS 140, 1982.

No context found.

G. Winskel (1982), Event Structure Semantics for CCS and related languages, in Proceedings of ICALP 82, M. Nielsen and E.M. Schmidt (Eds.), Lecture Notes in Computer Science 140, 561--576, SpringerVerlag.

No context found.

Glynn Winskel. Event structure semantics for CCS and related languages. In Proceedings of 9th ICALP, volume 140 of LNCS, pages 561-- 576. Springer, 1982.

No context found.

G. Winskel, Event Structure Semantics for CCS and Related Languages, in: Proc. 9th ICALP, Aarhus (M. Nielsen & E.M. Schmidt, eds.), Lect. Notes in Comp. Sc. 140, SpringerVerlag, Berlin, 1982, pp. 561-576.

First 50 documents

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