Testing equivalences and fully abstract models for probabilistic processes-Reference-Cited by-同舟云学术

Testing equivalences and fully abstract models for probabilistic processes

Published: Issue: Volume: Page:126-138
ISSN:
Container-title:CONCUR '90 Theories of Concurrency: Unification and Extension
language:
Short-container-title:

Author:

Christoff Ivan

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0039056.pdf

Reference18 articles.

1. S. Abramsky. Observation equivalence as a testing equivalence. Theor. Comp. Sci.53, pp 225–241, 1987.

2. N. Akinaga, Decision Procedures for Relations on Probabilistic Transition Systems. MSc thesis, Department of Computer Systems, Uppsala University, Uppsala, Sweden, 1989. Available as report DoCS 89/19.

3. J.A. Bergstra, J.W. Klop. Process algebra for synchronous communication. Information and Control60, pp 109–137, 1984.

4. G. Berry, P.-L. Curien, J.-J. Lévy. Full abstraction for sequential languages: the state of the art. Algebraic Methods in Semantics, eds. M. Nivat and J.C. Reynolds, Cambridge University Press, pp 89–132, 1985.

5. I. Christoff. Distinguishing probabilistic processes through testing. Manuscript presented at Nordic Workshop on Program Correctness, Uppsala, Sweden, 1989.

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

1. Model-Based Testing of Quantum Computations;Lecture Notes in Computer Science;2024-09-10

2. Genesis and Evolution of ULTraS: Metamodel, Metaequivalences, Metaresults;Models, Languages, and Tools for Concurrent and Distributed Programming;2019

3. Probabilistic Interface Automata;IEEE Transactions on Software Engineering;2016-09-01

4. Using schedulers to test probabilistic distributed systems;Formal Aspects of Computing;2012-07

5. Characterising Probabilistic Processes Logically;Logic for Programming, Artificial Intelligence, and Reasoning;2010