Sciweavers

443 search results - page 33 / 89
» Relations in Concurrency
Sort
View
BIRTE
2006
125views Business» more  BIRTE 2006»
14 years 17 days ago
Transaction Reordering and Grouping for Continuous Data Loading
With the increasing popularity of operational data warehousing, the ability to load data quickly and continuously into an RDBMS is becoming more and more important. However, in th...
Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Mi...
FMOODS
2003
13 years 10 months ago
Inductive Proof Outlines for Monitors in Java
The research concerning Java’s semantics and proof theory has mainly focussed on various aspects of sequential sub-languages. Java, however, integrates features of a class-based ...
Erika Ábrahám, Frank S. de Boer, Wil...
AGENTCL
2000
Springer
14 years 1 months ago
Using Colored Petri Nets for Conversation Modeling
Conversations are a useful means of structuring communicative interactions among agents. The value of a conversation-based approach is largely determined by the conversational mod...
R. Scott Cost, Ye Chen, Timothy W. Finin, Yannis L...
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
14 years 2 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
CONCUR
1992
Springer
14 years 28 days ago
Discrete Time Process Algebra
We introduce an ACP-style discrete-time process algebra with relative timing, that features the empty process. Extensions to this algebra are described, and ample attention is pai...
Jos C. M. Baeten, Jan A. Bergstra