Sciweavers

4353 search results - page 245 / 871
» Expressiveness of Process Algebras
Sort
View
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
15 years 10 months ago
An extensible test framework for the Microsoft StreamInsight query processor
Microsoft StreamInsight (StreamInsight, for brevity) is a platform for developing and deploying streaming applications. StreamInsight adopts a deterministic stream model that leve...
Alex Raizman, Asvin Ananthanarayan, Anton Kirilov,...
DBPL
1993
Springer
141views Database» more  DBPL 1993»
15 years 10 months ago
Some Properties of Query Languages for Bags
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
Leonid Libkin, Limsoon Wong
FMCO
2005
Springer
16 years 2 days ago
Separation Results Via Leader Election Problems
Abstract. We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes. We consider the π-calculus with mixe...
Maria Grazia Vigliotti, Iain Phillips, Catuscia Pa...
ICALP
2005
Springer
16 years 2 days 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
FOSSACS
2004
Springer
15 years 10 months ago
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
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...
Wan Fokkink, Sumit Nain