Transition system specifications in stalk format with bisimulation as a congruence

Oostrom, Vincent van; Vink, Erik P. de

doi:10.1007/3-540-57785-8_172

Search citation statements

Order By: Relevance

Paper Sections

Select...

Panth Format1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1994

2000

Publication Types

Select...

Book2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its least three-valued stable model contains the following unknown transitions: [169] generalized the tyft/tyxt format (so in the absence of predicates and negative premises) to the stalk format, by somewhat relaxing the constraint that sources of transition rules can contain no more than one function symbol. They proved that the congruence result in Thm.…”

Section: Panth Formatmentioning

confidence: 99%

Structural Operational Semantics

Aceto¹,

Fokkink²,

Verhoef³

1999

BRICS

View full text Add to dashboard Cite

The importance of giving precise semantics to programming and specification languages was recognized since the sixties with the development of the first high-level programming languages (cf. e.g. [30, 206] for some early accounts). The use of operational semantics - i.e. of a semantics that explicitly describes how programs compute in stepwise fashion, and the possible state-transformations they perform - was already advocated by McCarthy in [147], and elaborated upon in references like [142, 143]. Examples of full-blown languages that have been endowed with an operational semantics are Algol 60 [140], PL/I [173], and CSP [178].

show abstract

Section: Panth Formatmentioning

confidence: 99%