Conditional Expectation and the Approximation of Labelled Markov Processes-Reference-Cited by-同舟云学术

Conditional Expectation and the Approximation of Labelled Markov Processes

Published:2003 Issue: Volume: Page:477-491
ISSN:0302-9743
Container-title:CONCUR 2003 - Concurrency Theory
language:
Short-container-title:

Author:

Danos Vincent,Desharnais Josée,Panangaden Prakash

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45187-7_31

Reference16 articles.

1. Arveson, W.: An Invitation to C ∗-Algebra. Springer, Heidelberg (1976)

2. Choquet, G.: Theory of capacities. Ann. Inst. Fourier (Grenoble) 5, 131–295 (1953)

3. Danos, V., Desharnais, J.: Note sur les chaînes de Markov étiquetées. Unpublished, in french (2002)

4. Danos, V., Desharnais, J.: A fixpoint logic for labeled Markov Processes. In: Esik, Z., Walukiewicz, I. (eds.) Proceedings of an international Workshop FICS 2003 (Fixed Points in Computer Science), Warsaw (2003)

5. Danos, V., Desharnais, J.: Labeled Markov Processes: Stronger and faster approximations. In: Proceedings of the 18th Symposium on Logic in Computer Science. IEEE, Los Alamitos (2003)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distribution-Based Bisimulation for Labelled Markov Processes;Lecture Notes in Computer Science;2017

2. Approximating Markov Processes by Averaging;Journal of the ACM;2014-01

3. Approximating Markov Processes by Averaging;Automata, Languages and Programming;2009

4. Approximating Labelled Markov Processes Again!;Algebra and Coalgebra in Computer Science;2009

5. On finite-state approximants for probabilistic computation tree logic;Theoretical Computer Science;2005-11