| J. F. Groote and F. W. Vaandrager. Structural operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202--260, 1992. |
....pieces of research that most closely impinge on the specific problems that I address in this dissertation. The idea of finding conditions under which a labelled transition relation yields an operational congruence has been thoroughly studied in work on structural operational semantics (SOS) GV92, TP97] The principle is to postulate rule formats, conditions on an inductive presentation of a labelled transition relation that ensure that operational equivalences (e.g. weak bisimulation [Blo93] are congruences. There is a fundamental di#erence between this problem and the one I am looking ....
.... are several interesting questions that follow: Under what conditions can we derive an inductive presentation that generates precisely the same labelled transition relation as the direct presentation gives Under what conditions would an inductive presentation satisfy any of the GSOS rule formats [GV92, Blo93] If some set of the latter is satisfied, it would be enlightening to compare two di#erent proofs of congruence for strong bisimulation, say one based on the RPO theory shown in this dissertation and the other based on GSOS reasoning, particularly as provided by recent categorical ....
J. F. Groote and F. W. Vaandrager. Structural operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202--260, 1992. {14, 129}
....the work on structured operational semantics (SOS) and bisimilarity should be mentioned. About a decade ago much work was done to determine conditions on an LTS defined by SOS which ensure that the associated bisimilarity equivalence is a congruence. This is well reported by Groote and Vaandrager [9], and has recently been understood in categorical terms by Turi and Plotkin [24] In that work the LTS is given inductively on the structure of terms. Our work is complementary; we construct an LTS. We are therefore offered the challenge to see whether our LTS can be presented inductively. ....
Groote, J.F. and Vaandrager, F.W., Structural operational semantics and bisimulation as a congruence. Information and Computation 100(2), pp. 202--260, 1992.
....model; in the Process Algebra [3] which originated with Bergstra and Klop the emphasis was upon an algebraic theory rather than upon transitions. But LTSs have been prominent, and they led to an intense study of the di erent equivalences they induce [9] and of their congruential properties [10, 24]. With the calculus [18] the LTS methodology became strained because the passage of names as messages required a somewhat ad hoc structure in the labels. For this reason Milner [16] inspired by the Chemical Abstract Machine of Berry and Boudol [4] devised an alternate semantics based upon ....
Groote, J.F. and Vaandrager, F.W., Structural operational semantics and bisimulation as a congruence. Information and Computation 100(2), pp. 202-260, 1992.
No context found.
J. F. Groote and F. W. Vaandrager. Structural operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202--260, 1992.
No context found.
J. Groote and F. Vaandrager. Structural operational semantics and bisimulation as a congruence (extended abstract). In Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP'89), volume 372 of LNCS, pages 423--438. Springer-Verlag, 1989.
No context found.
Jan Friso Groote and Frits W. Vaandrager. Structural operational semantics and bisimulation as a congruence (extended abstract). In Giorgio Ausiello, Mariangiola Dezani-Ciancaglini, and Simona Ronchi Della Rocca, editors, Automata, Languages and Programming, 16th International Colloquium, volume 372 of Lecture Notes in Computer Science, pages 423--438. Springer Verlag, July 1989.
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