Sciweavers

4353 search results - page 246 / 871
» Expressiveness of Process Algebras
Sort
View
FOSSACS
2006
Springer
15 years 10 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»
15 years 6 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»
16 years 1 days 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...
FROCOS
2000
Springer
15 years 10 months ago
Non-Trivial Symbolic Computations in Proof Planning
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
Volker Sorge
FMOODS
2000
15 years 8 months ago
Behavioural Subtyping and Property Preservation
Inheritance is one of the key features in object-oriented design and analysis. It especially supports an incremental development by allowing to stepwise add new functionality to an...
Heike Wehrheim