AbstractThis article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements on Groote's ntyft format. It extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, and negative premises
Abstract. We present a method for decomposing modal formulas for processes with the internal action ...
In this paper we describe the promoted tyft/tyxt rule format for defining higher-order languages. Th...
In this study, we present rule formats for four main notions of bisimulation with silent moves. Wea...
This article presents a congruence format, in structural operational semantics, for rooted branching...
This article presents a congruence format, in structural operational semantics, for rooted branching...
AbstractThis article presents a congruence format, in structural operational semantics, for rooted b...
We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process sp...
. We proposed a syntactic format, the panth format, for structured operational semantics in which be...
AbstractIn TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with sil...
In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent move...
This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation ...
While studying the specification of the operational semantics of different programming languages and...
AbstractIn this study, we present rule formats for four main notions of bisimulation with silent mov...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
Abstract. We present a method for decomposing modal formulas for processes with the internal action ...
In this paper we describe the promoted tyft/tyxt rule format for defining higher-order languages. Th...
In this study, we present rule formats for four main notions of bisimulation with silent moves. Wea...
This article presents a congruence format, in structural operational semantics, for rooted branching...
This article presents a congruence format, in structural operational semantics, for rooted branching...
AbstractThis article presents a congruence format, in structural operational semantics, for rooted b...
We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process sp...
. We proposed a syntactic format, the panth format, for structured operational semantics in which be...
AbstractIn TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with sil...
In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent move...
This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation ...
While studying the specification of the operational semantics of different programming languages and...
AbstractIn this study, we present rule formats for four main notions of bisimulation with silent mov...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
Abstract. We present a method for decomposing modal formulas for processes with the internal action ...
In this paper we describe the promoted tyft/tyxt rule format for defining higher-order languages. Th...
In this study, we present rule formats for four main notions of bisimulation with silent moves. Wea...
DOI
Add to ORKG
