Sciweavers

4586 search results - page 544 / 918
» Computing stable models in parallel
Sort
View
CONCUR
2000
Springer
15 years 9 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
ICDCS
2010
IEEE
15 years 9 months ago
Quantifying and Querying Network Reachability
—Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenanc...
Amir R. Khakpour, Alex X. Liu
HLPPP
1991
15 years 8 months ago
Reasoning About Synchronic Groups
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...
Gruia-Catalin Roman, H. Conrad Cunningham
WSC
2008
15 years 7 months ago
High performance spreadsheet simulation on a desktop grid
We present a proof-of-concept prototype for high performance spreadsheet simulation called S3. Our goal is to provide a user-friendly, yet computationally powerful simulation envi...
Juta Pichitlamken, Supasit Kajkamhaeng, Putchong U...
WSC
1997
15 years 6 months ago
Minimum Cost Adaptive Synchronization: Experiments with the ParaSol System
We present a novel adaptive synchronization algorithm, called the minimum average cost (MAC) algorithm, in the context of the ParaSol parallel simulation system. ParaSol is a mult...
Edward Mascarenhas, Felipe Knop, Vernon Rego