Sciweavers

44 search results - page 4 / 9
» Kleene Theorems for Product Systems
Sort
View
CCA
2009
Springer
14 years 2 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
LICS
2009
IEEE
14 years 2 months ago
An Algebra for Kripke Polynomial Coalgebras
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...
CDC
2009
IEEE
181views Control Systems» more  CDC 2009»
14 years 13 days ago
Stability of switched linear systems and the convergence of random products
— In this paper we give conditions that a discrete time switched linear systems must satisfy if it is stable. We do this by calculating the mean and covariance of the set of matr...
Ning Wang, Magnus Egerstedt, Clyde F. Martin
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
14 years 1 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...
ISSAC
2011
Springer
225views Mathematics» more  ISSAC 2011»
12 years 10 months ago
On the structure of compatible rational functions
A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-...
Shaoshi Chen, Ruyong Feng, Guofeng Fu, Ziming Li