Sciweavers

1701 search results - page 97 / 341
» Computer Science and State Machines
Sort
View
FOSSACS
2007
Springer
15 years 4 months ago
A Lower Bound on Web Services Composition
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...
Anca Muscholl, Igor Walukiewicz
ASM
2003
ASM
15 years 3 months ago
ASMs versus Natural Semantics: A Comparison with New Insights
Abstract. We compare three specification frameworks for the operationtics of programming languages, abstract state machines (ASMs) and the two incarnations of natural semantics, b...
Sabine Glesner
SC
2000
ACM
15 years 2 months ago
Parallel Smoothed Aggregation Multigrid: Aggregation Strategies on Massively Parallel Machines
Algebraic multigrid methods offer the hope that multigrid convergence can be achieved (for at least some important applications) without a great deal of effort from engineers an...
Ray S. Tuminaro, Charles Tong
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 5 months ago
Analysis of multi-stage open shop processing systems
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
Christian Eggermont, Alexander Schrijver, Gerhard ...
SOFSEM
2007
Springer
15 years 4 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger