2171 search results - page 180 / 435 » A Generic Process Algebra |
117
Voted
FOSSACS
2004
Springer
15 years 7 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...
109
Voted
FOSSACS
2006
Springer
15 years 7 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...
122
Voted
ENTCS
2007
15 years 3 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 ...
165
click to vote
PRDC
2009
IEEE
15 years 10 months ago
2009
IEEE
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
157
click to vote
ICVS
2001
Springer
15 years 8 months ago
2001
Springer
An increasing number of computer vision applications require on-line processing of data streams, preferably in real-time. This trend is fueled by the mainstream availability of low...