Sciweavers

932 search results - page 40 / 187
» Verifying Progress in Timed Systems
Sort
View
FOCS
1999
IEEE
15 years 4 months ago
PSPACE Has Constant-Round Quantum Interactive Proof Systems
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
John Watrous
RTCSA
2006
IEEE
15 years 5 months ago
Predictable Interrupt Scheduling with Low Overhead for Real-Time Kernels
In this paper we analyze the traditional model of interrupt management and its inability to incorporate the reliability and temporal predictability demanded by real-time systems. ...
Luis E. Leyva-del-Foyo, Pedro Mejía-Alvarez...
DAGSTUHL
2008
15 years 1 months ago
Extending the Range of C-XSC: Some Tools and Applications for the use in Parallel and other Environments
We present some examples of extensions for C-XSC that have been developed lately. Among these are extensions that give access to further hardware and software environments as well ...
Markus Grimmer
TACAS
2007
Springer
92views Algorithms» more  TACAS 2007»
15 years 6 months ago
Model Checking Liveness Properties of Genetic Regulatory Networks
Abstract. Recent studies have demonstrated the possibility to build genetic regulatory networks that confer a desired behavior to a living organism. However, the design of these ne...
Grégory Batt, Calin Belta, Ron Weiss
RP
2010
Springer
118views Control Systems» more  RP 2010»
14 years 9 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa