Sciweavers

3653 search results - page 120 / 731
» On Recognizable Timed Languages
Sort
View
EPEW
2005
Springer
15 years 3 months ago
Timing Issues in Web Services Composition
webπ is a recent process calculus introduced to formally specify Web Services composition. It extends the π-calculus with timed workunits, namely an asynchronous and temporized m...
Manuel Mazzara
SIGMOD
1987
ACM
69views Database» more  SIGMOD 1987»
15 years 1 months ago
Extending the Relational Algebra to Support Transaction Time
In this paper we discuss extensions to the conventional relatronal algebra to support transaction time We show that these extensions are applicable to hrstorlcal algebras that sup...
L. Edwin McKenzie, Richard T. Snodgrass
DATE
2008
IEEE
157views Hardware» more  DATE 2008»
15 years 4 months ago
Logical Reliability of Interacting Real-Time Tasks
We propose the notion of logical reliability for real-time program tasks that interact through periodically updated program variables. We describe a reliability analysis that chec...
Krishnendu Chatterjee, Arkadeb Ghosal, Thomas A. H...
ECOOP
2007
Springer
15 years 4 months ago
Generational Real-Time Garbage Collection
Abstract. While real-time garbage collection is now available in production virtual machines, the lack of generational capability means applications with high allocation rates are ...
Daniel Frampton, David F. Bacon, Perry Cheng, Davi...
IJCNLP
2004
Springer
15 years 3 months ago
Statistical Substring Reduction in Linear Time
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
Xueqiang Lü Le Zhang, Junfeng Hu