Sciweavers

87 search results - page 17 / 18
» GSOS for Probabilistic Transition Systems
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 6 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
FSTTCS
2010
Springer
13 years 3 months ago
Generalizing the powerset construction, coalgebraically
a is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behav...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...
IANDC
2007
152views more  IANDC 2007»
13 years 5 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
HPCA
2009
IEEE
14 years 6 months ago
A first-order fine-grained multithreaded throughput model
Analytical modeling is an alternative to detailed performance simulation with the potential to shorten the development cycle and provide additional insights. This paper proposes a...
Xi E. Chen, Tor M. Aamodt
LICS
2007
IEEE
14 years 2 days ago
Game Relations and Metrics
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...