Sciweavers

950 search results - page 100 / 190
» Process Algebra in PVS
Sort
View
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
15 years 7 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,...
AMCS
2011
341views Mathematics» more  AMCS 2011»
14 years 10 months ago
FSP and FLTL framework for specification and verification of middle-agents
Agents are a useful abstraction frequently employed as a basic building block in modeling service, information and resource sharing in global environments. The connecting of reques...
Amelia Badica, Costin Badica
ICALP
2005
Springer
15 years 8 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
FOSSACS
2004
Springer
15 years 7 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
FOSSACS
2006
Springer
15 years 7 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