Displaying similar documents to “The compositional construction of Markov processes II”

The compositional construction of Markov processes II

L. de Francesco Albasini, N. Sabadini, R. F. C. Walters (2011)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We add sequential operations to the categorical algebra of weighted and Markov automata introduced in [L. de Francesco Albasini, N. Sabadini and R.F.C. Walters, 
arXiv:0909.4136]. The extra expressiveness of the algebra permits the description of hierarchical systems, and ones with evolving geometry. We make a comparison with the probabilistic automata of Lynch [ 37 (2007) 977–1013].

Thread algebra for noninterference

Thuy Duong Vu (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

Thread algebra is a semantics for recent object-oriented programming languages [J.A. Bergstra and M.E. Loots, (2002) 125–156; J.A. Bergstra and C.A. Middelburg, (2007)] such as C# and Java. This paper shows that thread algebra provides a process-algebraic framework for reasoning about and classifying various standard notions of noninterference, an important property in secure information flow. We will take the noninterference property given by Volpano  [D. Volpano,...

Asymptotic properties of autoregressive regime-switching models

Madalina Olteanu, Joseph Rynkiewicz (2012)

ESAIM: Probability and Statistics

Similarity:

The statistical properties of the likelihood ratio test statistic (LRTS) for autoregressive regime-switching models are addressed in this paper. This question is particularly important for estimating the number of regimes in the model. Our purpose is to extend the existing results for mixtures [X. Liu and Y. Shao, (2003) 807–832] and hidden Markov chains [E. Gassiat, (2002) 897–906]. First, we study the case of mixtures of autoregressive models (independent...

Undecidability of infinite post correspondence problem for instances of size 8

Jing Dong, Qinghui Liu (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

The infinite Post Correspondence Problem (PCP) was shown to be undecidable by Ruohonen (1985) in general. Blondel and Canterini [ (2003) 231–245] showed that PCP is undecidable for domain alphabets of size 105, Halava and Harju [ (2006) 551–557] showed that PCP is undecidable for domain alphabets of size 9. By designing a special coding, we delete a letter from Halava and Harju’s construction. So we prove that PCP is undecidable for domain alphabets of size...

Wiener integral for the coordinate process under the -finite measure unifying Brownian penalisations

Kouji Yano (2011)

ESAIM: Probability and Statistics

Similarity:

Wiener integral for the coordinate process is defined under the -finite measure unifying Brownian penalisations, which has been introduced by [Najnudel , (2007) 459–466] and [Najnudel , . Mathematical Society of Japan, Tokyo (2009)]. Its decomposition before and after last exit time from 0 is studied. This study prepares for the author's recent study [K. Yano, (2010) 3492–3516] of Cameron-Martin formula for the -finite measure. ...