AbstractThis paper contributes to the study of the equational theory of the priority operator of Baeten, Bergstra and Klop in the setting of the process algebra BCCSP. It is shown that, in the presence of at least two actions, the collection of process equations over BCCSP with the priority operator that are valid modulo bisimilarity, irrespective of the chosen priority order over actions, is not finitely based. This holds true even if one restricts oneself to the collection of valid process equations that do not contain occurrences of process variables
AbstractThis paper presents a process algebra for distributed systems in which some actions may take...
It has long been recognised that standard process algebra has difficulty dealing with actions of dif...
This paper presents a process algebra for distributed systems in which some actions may take precede...
This paper contributes to the study of the equational theory of the priority operator of Baeten, Ber...
This paper contributes to the study of the equational theory of the priority operator of Baeten, Ber...
AbstractThis paper contributes to the study of the equational theory of the priority operator of Bae...
This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP ...
This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP ...
Aceto et al., proved that, over the process algebra BCCSP with the priority operator of Baeten, Berg...
Aceto et al., proved that, over the process algebra BCCSP with the priority operator of Baeten, Berg...
This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP ...
This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP ...
An operational semantics for an algebraic theory of concur-rency is developed that incorporates a no...
AbstractAn operational semantics for an algebraic theory of concurrency that incorporates a notion o...
AbstractMore than 15 years ago, Cleaveland and Hennessy proposed an extension of the process algebra...
AbstractThis paper presents a process algebra for distributed systems in which some actions may take...
It has long been recognised that standard process algebra has difficulty dealing with actions of dif...
This paper presents a process algebra for distributed systems in which some actions may take precede...
This paper contributes to the study of the equational theory of the priority operator of Baeten, Ber...
This paper contributes to the study of the equational theory of the priority operator of Baeten, Ber...
AbstractThis paper contributes to the study of the equational theory of the priority operator of Bae...
This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP ...
This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP ...
Aceto et al., proved that, over the process algebra BCCSP with the priority operator of Baeten, Berg...
Aceto et al., proved that, over the process algebra BCCSP with the priority operator of Baeten, Berg...
This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP ...
This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP ...
An operational semantics for an algebraic theory of concur-rency is developed that incorporates a no...
AbstractAn operational semantics for an algebraic theory of concurrency that incorporates a notion o...
AbstractMore than 15 years ago, Cleaveland and Hennessy proposed an extension of the process algebra...
AbstractThis paper presents a process algebra for distributed systems in which some actions may take...
It has long been recognised that standard process algebra has difficulty dealing with actions of dif...
This paper presents a process algebra for distributed systems in which some actions may take precede...