Sciweavers

1274 search results - page 148 / 255
» New Proofs for
Sort
View
IANDC
2007
132views more  IANDC 2007»
15 years 5 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza
SIAMCO
2008
93views more  SIAMCO 2008»
15 years 5 months ago
Dissipative Boundary Conditions for One-Dimensional Nonlinear Hyperbolic Systems
We give a new sufficient condition on the boundary conditions for the exponential stability of one-dimensional nonlinear hyperbolic systems on a bounded interval. Our proof relies ...
Jean-Michel Coron, Georges Bastin, Brigitte d'Andr...
ACTA
2005
92views more  ACTA 2005»
15 years 5 months ago
Type-based information flow analysis for the pi-calculus
We propose a new type system for information flow analysis for the -calculus. As demonstrated by recent studies, information about whether each communication succeeds is important ...
Naoki Kobayashi
TCS
2008
15 years 5 months ago
Turing machines and bimachines
We associate the iterated block product of a bimachine with a deterministic Turing machine. This allows us to introduce new algebraic notions to study the behavior of the Turing m...
John Rhodes, Pedro V. Silva
DAM
2002
135views more  DAM 2002»
15 years 5 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera