Testing Reactive Probabilistic Processes

We define a testing equivalence in the spirit of De Nicola and Hennessy for reactive probabilistic processes, i.e. for processes where the internal nondeterminism is due to random behaviour. We characterize the testing equivalence in terms of ready-traces. From the characterization it follows that the equivalence is insensitive to the exact moment in time in which an internal probabilistic choice occurs, which is inherent from the original testing equivalence of De Nicola and Hennessy. We also show decidability of the testing equivalence for finite systems for which the complete model may not be known

On the ratio of the gravity change rate to the uplift rate in Southeast Alaska

第30回極域地学シンポジウム「極域から探る固体地球ダイナミクス」12月2日（木） 国語研究所 ２階講

Boundary Liouville theory at c=1

The c=1 Liouville theory has received some attention recently as the Euclidean version of an exact rolling tachyon background. In an earlier paper it was shown that the bulk theory can be identified with the interacting c=1 limit of unitary minimal models. Here we extend the analysis of the c=1-limit to the boundary problem. Most importantly, we show that the FZZT branes of Liouville theory give rise to a new 1-parameter family of boundary theories at c=1. These models share many features with the boundary Sine-Gordon theory, in particular they possess an open string spectrum with band-gaps of finite width. We propose explicit formulas for the boundary 2-point function and for the bulk-boundary operator product expansion in the c=1 boundary Liouville model. As a by-product of our analysis we also provide a nice geometric interpretation for ZZ branes and their relation with FZZT branes in the c=1 theory.Comment: 37 pages, 1 figure. Minor error corrected, slight change in result (1.6

Comparative branching-time semantics for Markov chains

This paper presents various semantics in the branching-time spectrum of discrete-time and continuous-time Markov chains (DTMCs and CTMCs).\ud Strong and weak bisimulation equivalence and simulation pre-orders are covered and are logically characterised in terms of the temporal logics PCTL (Probabilistic Computation Tree Logic) and CSL (Continuous Stochastic Logic). Apart from presenting various existing branching-time relations in a uniform manner, this paper presents the following new results: (i) strong simulation for CTMCs, (ii) weak simulation for CTMCs and DTMCs, (iii) logical characterizations thereof (including weak bisimulation for DTMCs), (iv) a relation between weak bisimulation and weak simulation equivalence, and (v) various connections between equivalences and pre-orders in the continuous- and discrete-time setting. The results are summarized in a branching-time spectrum for DTMCs and CTMCs elucidating their semantics as well as their relationship