A Theory of Testing for Markovian Processes-Reference-Cited by-同舟云学术

A Theory of Testing for Markovian Processes

Published:2000 Issue: Volume: Page:305-319
ISSN:0302-9743
Container-title:CONCUR 2000 — Concurrency Theory
language:
Short-container-title:

Author:

Bernardo Marco,Cleaveland Rance

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44618-4_23

Reference13 articles.

1. M. Bernardo, “Theory and Application of Extended Markovian Process Algebra”, Ph.D. Thesis, University of Bologna, 1999 (http://www.di.unito.it/~bernardo/)

2. M. Bernardo, W. R. Cleaveland, “A Theory of Efficiency for Markovian Processes”, Tech. Rep. UBLCS-99-02, University of Bologna, 1999

3. W. R. Cleaveland, M. C. B. Hennessy, “Testing Equivalence as a Bisimulation Equivalence”, in Formal Aspects of Computing 5:1–20, 1993

4. Lect Notes Comput Sci;W. R. Cleaveland,1992

5. R. De Nicola, M. C. B. Hennessy, “Testing Equivalences for Processes” in Theoretical Computer Science 34:83–133, 1983

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

1. A Formal Framework of Model and Logical Embeddings for Verification of Stochastic Systems;Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing;2024-04-08

2. State Space Minimization Preserving Embeddings for Continuous-Time Markov Chains;Lecture Notes in Computer Science;2021

3. Compositional Reasoning for Markov Decision Processes;Fundamentals of Software Engineering;2012

4. A formal framework to test soft and hard deadlines in timed systems;Software Testing, Verification and Reliability;2011

5. Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes;Trustworthly Global Computing;2010