Abstract: "In [Aceto, Bloom and Vaandrager, '92] two strategies are presented to produce axiomatisations of strong bisimulation equivalence for languages whose operational semantics can be expressed in the GSOS format of [Bloom, Istrail and Meyer, '90]. In [Aceto et al.] it is stated...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Bosscher, D. J. (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1994
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 94,5
Schlagworte:	Rewriting systems (Computer science)
Zusammenfassung:	Abstract: "In [Aceto, Bloom and Vaandrager, '92] two strategies are presented to produce axiomatisations of strong bisimulation equivalence for languages whose operational semantics can be expressed in the GSOS format of [Bloom, Istrail and Meyer, '90]. In [Aceto et al.] it is stated that if the GSOS systems satisfy certain finiteness conditions, one of these axiomatisations is strongly normalising and confluent. We show that their claim as a whole is wrong, but prove confluency and weak normalisation by presenting a normalising rewrite strategy. We can however prove strong normalisation for the axiomatisations of a decidable class of such systems. The analysis of the term rewriting properties of the axiomatisations is modulo the associativity and commutativity of the choice operation."
Beschreibung:	20 S.