Sciweavers

3238 search results - page 184 / 648
» On the Computational Interpretation of Negation
Sort
View
DAC
1996
ACM
15 years 10 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin
DEBS
2007
ACM
15 years 10 months ago
Prefix forwarding for publish/subscribe
We present a prefix forwarding algorithm for content-based publish/subscribe systems. Our algorithm performs only one content-based match per message regardless of the number of r...
Zbigniew Jerzak, Christof Fetzer
CTRS
1987
15 years 10 months ago
Confluence of Conditional Rewrite Systems
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar
APSCC
2008
IEEE
15 years 8 months ago
Optimizing the Execution Time of the SLA-based Workflow in the Grid with Parallel Processing Technology
Service Level Agreements (SLAs) is currently one of the major research topics in Grid Computing. Among many system components for the supporting of SLA-aware Gridbased workflow, t...
Dang Minh Quan, Jörn Altmann, Laurence Tianru...
LICS
2006
IEEE
16 years 17 days ago
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
Catuscia Palamidessi, Vijay A. Saraswat, Frank D. ...