On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems-Reference-Cited by-同舟云学术

On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems

Published:2009 Issue: Volume: Page:67-78
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Andova Suzana,Georgievska Sonja

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-95891-8_10

Reference25 articles.

1. Lecture Notes in Computer Science;L. Aceto,2002

2. Andova, S., Baeten, J.C.M., D’Argenio, P.R., Willemse, T.A.C.: A compositional merge of probabilistic processes in the alternating model. In: NWPT 2006 (2006)

3. Lecture Notes in Computer Science;S. Andova,2006

4. Andova, S., Georgievska, S., Trčka, N.: On compositionality, efficiency, and applicability of abstraction in probabilistic systems (2008), http://www.win.tue.nl/~sgeorgie/processalgebra.pdf

5. Andova, S., Willemse, T.A.C.: Branching bisimulation for probabilistic systems: characteristics and decidability. Theor. Comput. Sci. 356(3), 325–355 (2006)

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

1. Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?;ACM Transactions on Computational Logic;2022-10-20

2. A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice;The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy;2019

3. On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems;Lecture Notes in Computer Science;2009