Add to ORKGThis paper studies nested simulation and nested trace semantics over the language BCCSP, a basic formalism to express finite process behaviour. It is shown that none of these semantics affords finite (in)equational axiomatizations over BCCSP. In particular, for each of the nested semantics studied in this paper, the collection of sound, closed (in)equations over a singleton action set is not finitely based
htmlabstractThis paper contributes to the study of the equational theory of the semantics in van Gla...
This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over...
Abstract. Van Glabbeek (1990) presented the “linear time – branching time spectrum”, a lattice of be...
AbstractThis paper studies nested simulation and nested trace semantics over the language BCCSP, a b...
This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic for...
AbstractOne of the criteria that has been put forward for studying the mathematical tractability of ...
This note shows that the trace simulation preorder does not have a finite inequational basis over th...
2-nested simulation was introduced by Groote and Vaandrager [10] as the coarsest equivalence include...
This paper contributes to the study of the equational theory of the semantics in van Glabbeek's line...
This note collects some of the author's favourite results in classic process algebra, broadly constr...
Fokkink and Zantema ((1994) Computer Journal 37:259-267) have shown thatbisimulation equivalence has...
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equiva...
Van Glabbeek (1990) presented the linear time-branching time spectrum of behavioral equivalences for...
Fokkink and Zantema (Fokkink and Zantema 1994) have shown that bisimulation equivalence has a finite...
Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for...
htmlabstractThis paper contributes to the study of the equational theory of the semantics in van Gla...
This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over...
Abstract. Van Glabbeek (1990) presented the “linear time – branching time spectrum”, a lattice of be...
AbstractThis paper studies nested simulation and nested trace semantics over the language BCCSP, a b...
This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic for...
AbstractOne of the criteria that has been put forward for studying the mathematical tractability of ...
This note shows that the trace simulation preorder does not have a finite inequational basis over th...
2-nested simulation was introduced by Groote and Vaandrager [10] as the coarsest equivalence include...
This paper contributes to the study of the equational theory of the semantics in van Glabbeek's line...
This note collects some of the author's favourite results in classic process algebra, broadly constr...
Fokkink and Zantema ((1994) Computer Journal 37:259-267) have shown thatbisimulation equivalence has...
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equiva...
Van Glabbeek (1990) presented the linear time-branching time spectrum of behavioral equivalences for...
Fokkink and Zantema (Fokkink and Zantema 1994) have shown that bisimulation equivalence has a finite...
Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for...
htmlabstractThis paper contributes to the study of the equational theory of the semantics in van Gla...
This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over...
Abstract. Van Glabbeek (1990) presented the “linear time – branching time spectrum”, a lattice of be...