Sciweavers

942 search results - page 131 / 189
» Process Algebraic Non-product-forms
Sort
View
ICALP
2005
Springer
14 years 3 months ago
A Finite Basis for Failure Semantics
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...
Wan Fokkink, Sumit Nain
MDM
2005
Springer
117views Communications» more  MDM 2005»
14 years 3 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 3 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
HYBRID
1999
Springer
14 years 2 months ago
An Overview of Hybrid Simulation Phenomena and Their Support by Simulation Packages
Continuous system dynamics can be described by, possibly large, systems of di erential equations. These can be either ordinary di erential equations (ODEs) or contain algebraic con...
Pieter J. Mosterman
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 2 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi