Sciweavers

3750 search results - page 348 / 750
» Timed Automata Patterns
Sort
View
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
15 years 10 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
FOIKS
2004
Springer
15 years 10 months ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
ICSOC
2004
Springer
15 years 10 months ago
Automated composition of e-services: lookaheads
The e-services paradigm promises to enable rich, flexible, and dynamic inter-operation of highly distributed, heterogeneous networkenabled services. Among the challenges, a funda...
Cagdas Evren Gerede, Richard Hull, Oscar H. Ibarra...
CONCUR
2001
Springer
15 years 9 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
STACS
1997
Springer
15 years 8 months ago
Methods and Applications of (MAX, +) Linear Algebra
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
Stephane Gaubert, Max Plus