Abstract: "In this article the general approach to Plotkin style operational semantics of [12] is extended to Transition System Specifications (TSS's) with rules that may contain negative premises. Two problems arise: firstly the rules may be inconsistent, and secondly it is not obvious ho...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Groote, Jan F. (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1989
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,50
Schlagworte:	Computer programming > Semantics Parallel programming (Computer science) > Semantics
Zusammenfassung:	Abstract: "In this article the general approach to Plotkin style operational semantics of [12] is extended to Transition System Specifications (TSS's) with rules that may contain negative premises. Two problems arise: firstly the rules may be inconsistent, and secondly it is not obvious how a TSS determines a transition relation. We present a general method, based on the stratification technique in logic programming, to prove consistency of a set of rules and we show how a specific transition relation can be associated with a TSS in a natural way. Then a special format for the rules, the ntyft/ntyxt-format, is defined. It is shown that for this format three important theorems hold The first theorem says that bisimulation is a congruence if all operators are defined using this format. The second theorem states that under certain restrictions a TSS in ntyft-format can be added conservatively to a TSS in pure ntyft/ntyxt-format. Finally, it is shown that the trace congruence for image finite processes induced by the pure ntyft/ntyxt-format is precisely bisimulation equivalence.
Beschreibung:	26 S.