AbstractA general and abstract framework to defining congruence formats for various process equivalences is presented. The framework extends bialgebraic techniques of Turi and Plotkin with an abstract coalgebraic approach to process equivalence, based on a notion of test suite. The resulting technique is illustrated on the example of completed trace equivalence. Rather than providing formal proofs, the paper is guiding the reader through the process of deriving a congruence format in the test suite approach
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning...
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...
AbstractA general and abstract framework to defining congruence formats for various process equivale...
AbstractAn abstract coalgebraic approach to well-structured relations on processes is presented, bas...
AbstractBialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal r...
AbstractThis paper presents a new format for process algebras, the extended tyft/tyxt format which g...
textabstractIt was observed by Turi and Plotkin that structural operational semantics can be studied...
In the mid-nineties, Turi and Plotkin gave an elegant categorical treatment of denotational and oper...
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed orig...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
International audienceApplicative bisimilarity is a coinductive characterisation of observational e...
AbstractWe present congruence formats for η- and rooted η-bisimulation equivalence. These formats ar...
A framework of Plotkin and Turis, originally aimed at providing an abstract notion of bisimulation, ...
The analysis of concurrent and reactive systems is based to a large degree on various notions of pro...
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning...
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...
AbstractA general and abstract framework to defining congruence formats for various process equivale...
AbstractAn abstract coalgebraic approach to well-structured relations on processes is presented, bas...
AbstractBialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal r...
AbstractThis paper presents a new format for process algebras, the extended tyft/tyxt format which g...
textabstractIt was observed by Turi and Plotkin that structural operational semantics can be studied...
In the mid-nineties, Turi and Plotkin gave an elegant categorical treatment of denotational and oper...
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed orig...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
International audienceApplicative bisimilarity is a coinductive characterisation of observational e...
AbstractWe present congruence formats for η- and rooted η-bisimulation equivalence. These formats ar...
A framework of Plotkin and Turis, originally aimed at providing an abstract notion of bisimulation, ...
The analysis of concurrent and reactive systems is based to a large degree on various notions of pro...
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning...
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...