This note shows that the trace simulation preorder does not have a finite inequational basis over the language BCCSP. Indeed, no collection of sound inequations of bounded depth is ground-complete with respect to the trace simulation preorder over BCCSP even over a singleton set of actions
AbstractVan Glabbeek presented the linear time–branching time spectrum of behavioral semantics. He s...
Van Glabbeek presented the linear time-branching time spectrum of behavioral semantics. He studied t...
This paper studies the existence of finite equational axiomatisations of the interleaving parallel c...
This note shows that the trace simulation preorder does not have a finite inequational basis over th...
This paper contributes to the study of the equational theory of the semantics in van Glabbeek's line...
This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over...
This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic for...
AbstractThis paper studies nested simulation and nested trace semantics over the language BCCSP, a b...
Fokkink and Zantema ((1994) Computer Journal 37:259-267) have shown thatbisimulation equivalence has...
AbstractOne of the criteria that has been put forward for studying the mathematical tractability of ...
Fokkink and Zantema (Fokkink and Zantema 1994) have shown that bisimulation equivalence has a finite...
Abstract. We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomat...
htmlabstractThis paper contributes to the study of the equational theory of the semantics in van Gla...
This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic for...
This paper studies the (in)equational theory of simulation preorder and equivalence over the process...
AbstractVan Glabbeek presented the linear time–branching time spectrum of behavioral semantics. He s...
Van Glabbeek presented the linear time-branching time spectrum of behavioral semantics. He studied t...
This paper studies the existence of finite equational axiomatisations of the interleaving parallel c...
This note shows that the trace simulation preorder does not have a finite inequational basis over th...
This paper contributes to the study of the equational theory of the semantics in van Glabbeek's line...
This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over...
This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic for...
AbstractThis paper studies nested simulation and nested trace semantics over the language BCCSP, a b...
Fokkink and Zantema ((1994) Computer Journal 37:259-267) have shown thatbisimulation equivalence has...
AbstractOne of the criteria that has been put forward for studying the mathematical tractability of ...
Fokkink and Zantema (Fokkink and Zantema 1994) have shown that bisimulation equivalence has a finite...
Abstract. We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomat...
htmlabstractThis paper contributes to the study of the equational theory of the semantics in van Gla...
This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic for...
This paper studies the (in)equational theory of simulation preorder and equivalence over the process...
AbstractVan Glabbeek presented the linear time–branching time spectrum of behavioral semantics. He s...
Van Glabbeek presented the linear time-branching time spectrum of behavioral semantics. He studied t...
This paper studies the existence of finite equational axiomatisations of the interleaving parallel c...
DOI
Add to ORKG