114 search results - page 12 / 23 » Interactive Proof Systems with Polynomially Bounded Strategi... |
CRYPTO
2000
Springer
14 years 7 days ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
ATVA
2008
Springer
13 years 10 months ago
2008
Springer
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
EWCBR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
AUTOMATICA
2008
13 years 8 months ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
CONCUR
2004
Springer
14 years 1 months ago
2004
Springer
We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a synchronous model of ...