Sciweavers

391 search results - page 38 / 79
» Compositionality for Probabilistic Automata
Sort
View
CSL
2006
Springer
14 years 10 days ago
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
Alexander Moshe Rabinovich, Wolfgang Thomas
ETFA
2008
IEEE
14 years 3 months ago
Reactivity analysis of different Networked Automation System architectures
The reactivity of Networked Automation Systems (NAS) has direct influence on safety and quality aspects. It can be determined by a response time analysis, which itself can be calc...
Jürgen Greifeneder, Georg Frey
DM
2011
228views Education» more  DM 2011»
13 years 3 months ago
The largest missing value in a composition of an integer
Archibald and Knopfmacher recently considered the largest missing value in a composition of an integer and established mean and variance. Our alternative, probabilistic approach p...
Margaret Archibald, Arnold Knopfmacher
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 8 months ago
Rational stochastic languages
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
François Denis, Yann Esposito
FOSSACS
2008
Springer
13 years 10 months ago
Compositional Methods for Information-Hiding
Protocols for information-hiding often use randomized primitives to obfuscate the link between the observables and the information to be protected. The degree of protection provide...
Christelle Braun, Konstantinos Chatzikokolakis, Ca...