Add to ORKGOne of the most satisfactory results in process theory is Milner's axiomatization of strong bisimulation for regular CCS. This result holds for open terms with finite-state recursion. Wang has shown that timed bisimulation can also be axiomatized, but only for closed terms without recursion. In this paper, we provide an axiomatization for timed bisimulation of open terms with finite-state recursion
In this paper we prove completeness of four axiomatisations for finite-state behaviours with respect...
complete axiomatization of timed bisimulation for a class of timed regular behaviour
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s...
AbstractOne of the most satisfactory results in process theory is Milner's axiomatization of strong ...
AbstractA real-time process algebra, called ACSR, has been developed to facilitate the specification...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
AbstractWe present our work on extending the standard machinery for weak bisimulation to deal with: ...
Van Glabbeek (1990) presented the linear time-branching time spectrum of behavioral equivalences for...
A variant of the standard notion of branching bisimilarity for processes with discrete relative timi...
This thesis presents and studies a timed computational model of parallelism, a Timed Calculus of Com...
This paper introduces the counterpart of strong bisimilarity for labelled transition systems extende...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
Prefix iteration is a variation on the original binary version of the Kleene star operation P*Q, obt...
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class ...
AbstractWe study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting o...
In this paper we prove completeness of four axiomatisations for finite-state behaviours with respect...
complete axiomatization of timed bisimulation for a class of timed regular behaviour
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s...
AbstractOne of the most satisfactory results in process theory is Milner's axiomatization of strong ...
AbstractA real-time process algebra, called ACSR, has been developed to facilitate the specification...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
AbstractWe present our work on extending the standard machinery for weak bisimulation to deal with: ...
Van Glabbeek (1990) presented the linear time-branching time spectrum of behavioral equivalences for...
A variant of the standard notion of branching bisimilarity for processes with discrete relative timi...
This thesis presents and studies a timed computational model of parallelism, a Timed Calculus of Com...
This paper introduces the counterpart of strong bisimilarity for labelled transition systems extende...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
Prefix iteration is a variation on the original binary version of the Kleene star operation P*Q, obt...
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class ...
AbstractWe study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting o...
In this paper we prove completeness of four axiomatisations for finite-state behaviours with respect...
complete axiomatization of timed bisimulation for a class of timed regular behaviour
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s...