2167 search results - page 223 / 434 » Stochastic Process Algebras |
161
click to vote
ICALP
2005
Springer
16 years 1 days 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...
159
click to vote
FOSSACS
2004
Springer
15 years 10 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...
164
click to vote
FOSSACS
2006
Springer
15 years 10 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...
161
click to vote
ENTCS
2007
15 years 6 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 ...
174
click to vote
MDM
2005
Springer
16 years 16 hour ago
2005
Springer
In this paper we propose a query-driven approach for tuning the time/energy trade-off in sensor networks with mobile sensors. The tuning factors include re-positioning of mobile s...