Sciweavers

1724 search results - page 106 / 345
» Models for Concurrency
Sort
View
DAC
1996
ACM
14 years 2 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
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 11 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
DATE
2005
IEEE
143views Hardware» more  DATE 2005»
14 years 3 months ago
galsC: A Language for Event-Driven Embedded Systems
— We introduce galsC, a language designed for programming event-driven embedded systems such as sensor networks. galsC implements the TinyGALS programming model. At the local lev...
Elaine Cheong, Jie Liu
ENTCS
2007
104views more  ENTCS 2007»
13 years 10 months ago
General Reversibility
The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we t the core of...
Vincent Danos, Jean Krivine, Pawel Sobocinski
SIGSOFT
2010
ACM
13 years 8 months ago
Top ten ways to make formal methods for HPC practical
Almost all fundamental advances in science and engineering crucially depend on the availability of extremely capable high performance computing (HPC) systems. Future HPC systems w...
Ganesh Gopalakrishnan, Robert M. Kirby