A framework of Plotkin and Turis, originally aimed at providing an abstract notion of bisimulation, is modified to cover other operational equivalences and preorders. Combined with bialgebraic methods, it yields a technique for deriving syntactic formats for transition system specifications, which guarantee operational preorders to be precongruences. The technique is applied to the trace prorder, the completed trace preorder and the failures preorder. In the latter two cases, new syntactic formats guaranteeing precongruence properties are introduced
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
In this paper the question is considered in which cases a transition system specification in Plotkin...
AbstractThis article presents a congruence format, in structural operational semantics, for rooted b...
AbstractGroote and Vaandrager introduced the tyft format, which is a congruence format for strong bi...
AbstractA general and abstract framework to defining congruence formats for various process equivale...
Groote and Vaandrager introduced the tyft format, which is a congruence format for strong bisimulati...
AbstractThis paper presents a new format for process algebras, the extended tyft/tyxt format which g...
AbstractIn this paper we are interested in general properties of classes of transition system specif...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
AbstractWhile studying the specification of the operational semantics of different programming langu...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
It was observed by Turi and Plotkin that structural operational semantics can be studied at the leve...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
AbstractBialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal r...
A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system o...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
In this paper the question is considered in which cases a transition system specification in Plotkin...
AbstractThis article presents a congruence format, in structural operational semantics, for rooted b...
AbstractGroote and Vaandrager introduced the tyft format, which is a congruence format for strong bi...
AbstractA general and abstract framework to defining congruence formats for various process equivale...
Groote and Vaandrager introduced the tyft format, which is a congruence format for strong bisimulati...
AbstractThis paper presents a new format for process algebras, the extended tyft/tyxt format which g...
AbstractIn this paper we are interested in general properties of classes of transition system specif...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
AbstractWhile studying the specification of the operational semantics of different programming langu...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
It was observed by Turi and Plotkin that structural operational semantics can be studied at the leve...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
AbstractBialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal r...
A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system o...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
In this paper the question is considered in which cases a transition system specification in Plotkin...
AbstractThis article presents a congruence format, in structural operational semantics, for rooted b...