1532 search results - page 188 / 307 » An Algebraic Process Calculus |
154
Voted
TCS
2008
15 years 4 months ago
2008
Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the acad...
133
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
131
click to vote
FOSSACS
2004
Springer
15 years 8 months ago
2004
Springer
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
128
click to vote
FOSSACS
2006
Springer
15 years 8 months ago
2006
Springer
We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alph...
136
click to vote
ENTCS
2007
15 years 4 months ago
2007
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...