Sciweavers

1012 search results - page 108 / 203
» Process Algebra with Backtracking
Sort
View
FOSSACS
2006
Springer
13 years 11 months ago
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation
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...
Taolue Chen, Wan Fokkink, Sumit Nain
ENTCS
2007
126views more  ENTCS 2007»
13 years 8 months ago
Notes on Generative Probabilistic Bisimulation
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 ...
Simone Tini
MDM
2005
Springer
117views Communications» more  MDM 2005»
14 years 1 months ago
Tuning query performance in mobile sensor databases
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...
Vladimir Zadorozhny, Divyasheel Sharma, Prashant K...
ADC
2003
Springer
135views Database» more  ADC 2003»
14 years 1 months ago
A Petri Net-based Model for Web Service Composition
The Internet is going through several major changes. It has become a vehicle of Web services rather than just a repository of information. Many organizations are putting their cor...
Rachid Hamadi, Boualem Benatallah
VLDB
1994
ACM
128views Database» more  VLDB 1994»
14 years 2 days ago
From Nested-Loop to Join Queries in OODB
Most declarative SQL-like query languagesfor object-oriented database systems (OOSQL) are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-,...
Hennie J. Steenhagen, Peter M. G. Apers, Henk M. B...