P. Degano, R. De Nicola, and U. Montanari. On the consistency of "truly concurrent" operational and denotational semantics. [LIC88], 133--141. (pp 7, 22)  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... dels,and hencetheymotivatedirectlythestudyofnoninterleaving.Forexamples,seethe complementaryworksofVogler[90]and Boudol[10] Otherexamplesofequivalencesofoperationllyand denotationallydeflned noninterleavingsemanticshave beenprovidedby Boudoland Castellani[13] Degano,De Nicolaand Montanari [23],Gorrieri[28] and Mukund andNielsen[60] Transitionsystemsplay an important roleinmodelchecking.Interestingly, theextranotionofindependencehasrecentlyprovedtobe ofvalueinthesearch fore cientmo delcheckers see theworksofW olper[102] W e have choseninourtreatment ....

Degano,P.,De Nicola,R. and Montanari,U.,On theconsistencyof `trulyconcurrent'operationalanddenotationalsemantics,extendedabstract, inIEEE Third AnnualSymposiumon LogicinComputerScience, ComputerSocietyPress,pp.133-141,1988.

....order isomorphism. The reason is basically that in prime event structures, every event has a unique causal history. Unfortunately, model constructions for prime event structures are fairly complicated exactly because this causal history has to be kept unique for every event (cf. Degano et al. [7] and Loogen and Goltz [12] for de nitions and Vaandrager [20] for a further discussion) essentially any synchronisation in the past of a given event may necessitate the duplication of that event, introducing new copies for every synchronisation option. Another way of putting this is that local ....

P. Degano, R. De Nicola, and U. Montanari. On the consistency of `truly concurrent' operational and denotational semantics. In Third Annual Symposium on Logic in Computer Science, pages 133-141. IEEE, Computer Society Press, 1988. extended abstract.

....each x 2 S P into a family (x p : p 2 P ) where x p is determined uniquely by fy 2 p : y p xg, and by replacing each p 2 P by fx p : x 2 pg. Event and configuration structures representing behaviours can be combined with the aid of operations similar to those of CCS (cf. 4] 9] and [1]) These operations are defined assuming that actions are qualified as internal or noninternal and that some of the noninternal actions are regarded to be complementary and can be combined into single actions with the aid of a special associative partial operation (ff; fi) 7 Gamma ff ffl fi (cf. ....

.... that r 2 P k Q iff r consists of some p 2 P and q 2 Q in the sense that it is obtained from a disjoint union of p and q by combining some pairs of events x 2 p and y 2 q into single events z 2 r with label(z) label(x)ffllabel(y) For event structures a direct definition is more complicated (cf. [1]) but we can define E 0 k E 1 as evs(prime(conf(E 0 ) k conf(E 1 ) The considered operations on configuration structures are continuous w.r. to the 5 chain complete prefix order defined as P v Q iff P Q and q 2 P for all q 2 Q such that q S P . This guarantees the existence of least ....

P. DEGANO, R. DE NICOLA, U. MONTANARI,On the consistency of "truly concurrent" operational and denotational semantics, Proc. of the Symposium on Logic in Computer Science, Edinburgh, 1988, pp.133-141 48

....directly the study of noninterleaving. For examples, see the complementary works of Vogler [90] and Boudol [10] Other examples of equivalences of operationlly and denotationally defined noninterleaving semantics have been provided by Boudol and Castellani [13] Degano, De Nicola and Montanari [23], Gorrieri [28] and Mukund and Nielsen [60] Transition systems play an important role in model checking. Interestingly, the extra notion of independence has recently proved to be of value in the search for efficient model checkers see the works of Wolper [102] We have chosen in our treatment ....

Degano, P., De Nicola, R. and Montanari, U., On the consistency of `truly concurrent' operational and denotational semantics, extended abstract, in IEEE Third Annual Symposium on Logic in Computer Science, Computer Society Press, pp. 133--141, 1988.

....in the transition from a value [ e] D to a language Proc[ e] is new. The usual process algebraic operators based on sequential and parallel composition and choice are insufficient as an apparatus for causality. e.g. CCS terms can well be given denotational semantics as event structures [Degano, De Nicola, and Montanari 1988], but they generate only a regular subset. The typical causal structure that cannot be expressed has the shape of an N [Boudol and Castellani 1987] Figs. 14 and 4 contain Ns in large numbers. When CCS is translated to occurence nets [Goltz and Mycroft 1984] which, in contrast to general ....

Degano, P., De Nicola, R., and Montanari, U. 1988. On the consistency of "truly concurrent" operational and denotational semantics. In 3rd IEEE Symp. on Logic in Computer Science (LICS), pp. 133--141.

....(see [SNW96] which at least for the prime event structures case describes the behaviour of object systems as needed. In fact labelled event structures are often used to provide a semantics for process algebraic languages like CCS, SCCS, CSP, TCSP and LOTOS as can be found among others in [DNM88, BC88, LG91, Lan92, Win88] Our aim is to provide a semantics to modular systems specified in an object oriented language like Troll. The behaviour of systems is achieved from its interconnected modules by combining compositional and hiding mechanisms. In this paper our concern goes with defining ....

P. Degano, R. De Nicola, and U. Montanari. On the Consistency of "Truly Concurrent" Operational and Denotational Semantics. In Proc. Symposium on Logic in Computer Science, Edinburgh, pages 133--141, 1988.

....semantics (see [SNW96] which at least for the prime event structures case describes the behaviour of objects as needed. In fact labelled event structures are often used to provide a semantics for process algebraic languages like CCS, SCCS, CSP, TCSP and LOTOS as can be found among others in [DNM88, BC88, LG91, Lan92, Win88] Troll in its present shape does not promote a divide and conquer form of abstraction, in the sense that it does not allow the separate speci cation of system parts and their further interconnection to yield an operational whole. Furthermore, experience using Troll ....

....general form of labelled event structures, namely labelled ow event structures, when describing the semantics of CCS. In [Lan92] LOTOS is given a non interleaving semantics based on labelled bundle event structures. Approaches which use labelled prime event structures in process theory are [LG91, DNM88] and both de ne parallel composition but neither one nor the other uses a categorical framework. In [WN95] the authors de ne a general category of labelled structures and present both a product and a coproduct construction in it. The structure can be instantiated by prime event structures and ....

P. Degano, R. De Nicola, and U. Montanari. On the Consistency of "Truly Concurrent" Operational and Denotational Semantics. In Proc. Symposium on Logic in Computer Science, Edinburgh, pages 133-141, 1988.

....true concurrency semantics based on labeled prime event structures. They show that the interleaved view of the event structure semantics obtained by considering remainders of event structures after the execution of a single event is (weak) bisimilar to the operational semantics of TCSP. [12] proposed an approach to prove the consistency of an operational non interleaving semantics of CCS (with guarded recursion) and a denotational one based on labeled prime event structures. From the operational semantics an occurrence net is derived which is shown using the well known connection ....

P. Degano, R. De Nicola, and U. Montanari. On the consistency of `truly concurrent ' operational and denotational semantics (extended abstract). In Third Ann. Symp. on Logic in Comp. Sci., 133--141. IEEE Computer Society Press (1988)

....which relates (amongst others) a flow event structure semantics to the interleaving semantics of CCS. 6] proves the consistency between an operational semantics for theoretical CSP and a semantics based on labelled prime event structures. 6] extends the results of [55] to recursive processes. [20] proves the consistency between an operational non interleaving semantics of CCS and denotational semantics based on labelled prime event structures. The notion of consistency between different semantics has been recently studied in a general framework in [7] 7 Conclusions Our driving force is ....

P. Degano, R. De Nicola and U. Montanari. On the consistency of `truly concurrent' operational and denotational semantics (extended abstract). In 3rd Annual Symp. on Logic in Comp. Sci., pages 133--141. IEEE Computer Press, 1988.

....construction on prime event structures, by passing through their domains of configurations. In fact, direct definitions of parallel product on prime event structures although rather complicated have been given explicitly by Goltz and Loogen in [GL91] and by Degano, De Nicola and Montanari in [DDNM88]. More recently a simpler definition was proposed by Vaandrager in [Vaa89] 2 Flow event structures and product Flow event structures are a direct generalisation of prime event structures (we refer to [NPW81] for the definition of prime event structures) where the conflict relation is not ....

P. Degano, R. De Nicola, and U. Montanari. On the consistency of "truly concurrent" operational and denotational semantics. In Proceedings 3 th Annual Symposium on Logic in Computer Science, Edinburgh, pages 133--141. IEEE Computer Society Press, 1988.

No context found.

P. Degano, R. De Nicola, and U. Montanari. On the consistency of "truly concurrent" operational and denotational semantics. [LIC88], 133--141. (pp 7, 22)

No context found.

P. Degano, R. De Nicola, and U. Montanari. On the Consistency of "Truly Concurrent" Operational and Denotational Semantics. In Proc. Symposium on Logic in Computer Science, Edinburgh, pages 133--141, 1988.

No context found.

P. Degano, R. De Nicola & U. Montanari (1988): On the consistency of `truly concurrent' operational and denotational semantics. In Proceedings third Annual Symposium on Logic in Computer Science, Edinburgh, IEEE Computer Society Press, pp. 133--141.

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