E. Badouel and Ph. Darondeau. Structural operational specifications and trace automata. In Proc. CONCUR'92, Stony Brook, NY, LNCS 630, pages 302--316. Springer-Verlag, August 1992. 11  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the definition of [Pin91] referred to as without copy format. Copying allows several occurrences of the same variable x (or occurrences of derived variables y in the premises) to occur in the right hand side term of the rule. Finally, xyfg xyfz format strictly generalizes 6 the basic format of [BD92]. As far as we know, most of the well known description languages of the literature (e.g. Meije, SCCS, Esterel, Signal, bear an SOS specification description in this format (see Example 2) An operator of a given specification is an xyfg xyfz operator if all the rules for it are xyfg xyfz, ....

.... rule entails that P and P N are isomorphic (see definition in the Appendix) Theorem 1 Let P be a connected specification with bounded arity (call N the maximum) then P and P N are effectively equivalent (see appendix for the proof) 9 Notice that specification P N fits the basic format of [BD92]. Theorem 1, but mostly its generalization in Theorem 2, shows that, assuming the j equivalence criterion is accepted, the xyfg xyfz format is not more expressive than the basic format. The translation from P to P N would precisely deliver the same basic format presentation of CCS proposed in ....

[Article contains additional citation context not shown here]

E. Badouel and Ph. Darondeau. Structural operational specifications and trace automata. In Proc. CONCUR'92, Stony Brook, NY, LNCS 630, pages 302--316. Springer-Verlag, August 1992. 11

....De Simone language T . Every closed recursive term in the LTS associated with T is bisimilar to a closed CSP term in the LTS associated with CSP. The interested reader will find further expressiveness results for variations on De Simone languages and several notions of expressiveness in, e.g. [20, 71, 77, 101, 172, 221]. We end this section with a congruence result for trace equivalence (see Def. 2.4) with respect to De Simone languages. Theorem 5.21 If a TSS is in De Simone format, then trace equivalence is a congruence with respect to the LTS associated with it. 5.4 GSOS Format This section introduces one ....

....only finitely many other states. Definition 5.28 (Simple GSOS) A GSOS rule is simple if its target contains at most one function symbol. A GSOS language is simple if each of its transition rules is. Rule formats similar to the simple GSOS rules have emerged in work by several researchers, e.g. [20], 71, p. 230] and [172, Def. 13] Most of the standard operations in process algebras are given operational semantics by means of simple GSOS rules. An exception is the binary Kleene star, which was discussed in Sect. 5.4.1. Two further exceptions are the desynchronizing Delta operation ....

E. Badouel and P. Darondeau, Structural operational specifications and trace automata, in Cleaveland [64], pp. 302--316.

....a De Simone language T. Every closed recursive term in the LTS associated with T is bisimilar to a closed CSP term in the LTS associated with CSP. The interested reader will find further expressiveness results for variations on De Simone languages and several notions of expressiveness in, e.g. [20, 75, 80, 104, 179, 231]. 5.4 GSOS Format This section introduces one of the most thoroughly studied rule formats, viz. the GSOS format of Bloom, Istrail, and Meyer [58] We present some of the many results that have been developed for this rule format, focusing on its sanity properties, and its connections with ....

....finitely many other states. Definition 5.27 (Simple GSOS) A GSOS rule is simple if its target contains at most one function symbol. A GSOS language is simple if each of its transition rules is. 59 Rule formats similar to the simple GSOS rules have emerged in work by several researchers, e.g. [20], 75, p. 230] and [179, Def. 13] Most of the standard operations in process algebras are given operational semantics by means of simple GSOS rules. An exception is the binary Kleene star, which was discussed in Sect. 5.4.1. Two further exceptions are the desynchroniz ing A operation present ....

E. BADOUEL AND P. DARONDEAU, Structural operational specifications and trace automata, in Cleaveland [68], pp. 302-316.

....that is used. Using Plotkin s structural operational semantics (SOS) one can prove theorems for whole classes of languages at the same time. This is a much more efficient way to develop process theory, which in addition provides more insight. Examples of contributions along these lines are [33, 34, 14, 12, 10, 18, 11, 32, 13, 35, 2, 4, 19]. Milner had the idea that for a proper understanding of the basic issues concerning the behavior of concurrent systems it could be helpful to look for a simple language, with as few operators or combinators as possible, each of which embodies some distinct and intuitive idea, and which together ....

E. Badouel and P. Darondeau. Structural operational specifications and trace automata. In W.R. Cleaveland, editor, Proceedings CONCUR 92, Stony Brook, NY, USA, volume 630 of Lecture Notes in Computer Science, pages 302--316. Springer-Verlag, 1992.

....the definition of [Pin91] referred to as without copy format. Copying allows several occurrences of the same variable x (or occurrences of derived variables y in the premises) to occur in the right hand side term of the rule. Finally, xyfg xyfz format strictly generalizes the basic format of [BD92]. As far as we know, most of the well known description languages of the literature (e.g. Meije, SCCS, Esterel, Signal, bear an SOSspecification description in this format (see Example 4) An operator of a given specification is an xyfg xyfz operator if all the rules for it are xyfg xyfz, ....

....entails that P and P N are isomorphic (see definition in the Appendix) Theorem 14. Let P be a connected specification with bounded arity (call N the maximum) then P and P N are effectively equivalent (See Appendix for the full proof. Notice that specification P N fits the basic format of [BD92]. Theorem 14, but mostly its generalization in Theorem 15, shows that, assuming the j equivalence criterion is accepted, the xyfg xyfz format is not more expressive than the basic format. The translation from P to P N would precisely deliver the same basic format presentation of CCS proposed in ....

[Article contains additional citation context not shown here]

E. Badouel and Ph. Darondeau. Structural operational specifications and trace automata. In Proc. CONCUR'92, Stony Brook, NY, LNCS 630, pages 302--316. Springer-Verlag, August 1992.

....Petri nets, BC90] showed how to define event structures from CCS (see also [CGM90] Fer90] Yan93] However, all the above mentionned works locate in the framework of a particular language described with a particular Structural Operational Semantics specification. Badouel and Darondeau, in [BD92], enlarged the approach by exhibiting, this time, a class of specifications, and not only a particular specification, from which Trace Automata of [Sta89] i.e. transition system like models decorated by concurrency, can be derived. In this paper, we bring together the works of [GV89] and [BD92] ....

....[BD92] enlarged the approach by exhibiting, this time, a class of specifications, and not only a particular specification, from which Trace Automata of [Sta89] i.e. transition system like models decorated by concurrency, can be derived. In this paper, we bring together the works of [GV89] and [BD92] by defining truly concurrent behaviors. Namely, we describe truly concurrent models modulo a truly concurrent equivalence. The models we consider are Asynchronous Transition Systems (of [Shi85] and [Bed87] and the behavioral equivalence is ST bisimulation (of [GV87] Our appraoch has two main ....

[Article contains additional citation context not shown here]

E. Badouel and Ph. Darondeau. Structural operational specifications and trace automata. In Proc. CONCUR'92, Stony Brook, NY, LNCS 630, pages 302--316. Springer-Verlag, August 1992.

....operational semantics) as ordinary transition systems. Alternatively, asynchronous transition systems can arise directly through operational semantics, but where instead of just labels, transitions carry more complicated information from which event names and independence can be extracted (see [12, 60, 3] for three examples of this approach) The use of asynchronous transition systems in semantics is often less clumsy than that of nets, which can be extracted afterwards via the adjunction with nets though sometimes care must be taken to show that the constructions used stay within A 0 . The ....

Badouel, E. and Darondeau, P., Structural operational specifications and trace automata, in Cleaveland, W.R. (ed.), Concur '92, Springer LNCS 630, pp. 302--316, 1992.

....and Meije [Bou85] and many more variants and extensions. However, the general theory of transition system specifications has, compared to the bulk of the applications, attracted little attention. Apart from some comparative studies between SOS and differently formalized computational models, e.g. [BD92, BD93], a small number of formats for transition system specifications have been proposed in the literature, Sim84, BIM88, GV92, Gro90, Fok93] viz. so called De Simone, GSOS, tyft tyxt, ntyft ntyxt and tree rule format, respectively. Main questions studied are the bisimulation and complete trace ....

E. Badouel and P. Darondeau. Structural operational specifications and trace automata. In W.R. Cleaveland, editor, Proc. CONCUR'92, pages 302--316. LNCS 630, 1992.

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