Revisiting Interactive Markov Chains-Reference-Cited by-同舟云学术

Revisiting Interactive Markov Chains

Published:2003-05 Issue:5 Volume:68 Page:65-84
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Bravetti Mario

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. “On “Axiomatising Finite Concurrent Processes” ”;Aceto;SIAM Journal on Computing,1994

2. M. Bernardo, “Theory and Application of Extended Markovian Process Algebra”, Ph.D. Thesis, University of Bologna (Italy), 1999

3. M. Bravetti, “Specification and Analysis of Stochastic Real-Time Systems”, Ph.D. Thesis, University of Bologna (Italy), 2002. Available at http://www.cs.unibo.it/~bravetti

4. M. Bravetti, M. Bernardo, R. Gorrieri, “A Note on the Congruence Proof for Recursion in Markovian Bisimulation Equivalence”, in Proc. of the 6th Int. Workshop on Process Algebras and Performance Modeling (PAPM '98), C. Priami editor, pp. 153–164, Nice (France), September 1998

5. “The Theory of Interactive Generalized Semi-Markov Processes”;Bravetti;Theoretical Computer Science,2002

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

1. Proportional lumpability and proportional bisimilarity;Acta Informatica;2021-06-21

2. Proportional Lumpability;Lecture Notes in Computer Science;2019

3. Lumping-Based Equivalences in Markovian Automata and Applications to Product-Form Analyses;Quantitative Evaluation of Systems;2015

4. Lumping and reversed processes in cooperating automata;Annals of Operations Research;2014-08-22

5. Weak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Concurrent Processes;Electronic Proceedings in Theoretical Computer Science;2012-07-03