Fair testing-Reference-Cited by-同舟云学术

Fair testing

Published:2007-02 Issue:2 Volume:205 Page:125-198
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Rensink Arend,Vogler Walter

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference43 articles.

1. Process Algebra;Baeten,1990

2. J.A. Bergstra, J.W. Klop, Verification of an alternating bit protocol by means of process algebra, in: W. Bibel, K.P. Jantke (Eds.), Mathematical Methods of Specification and Synthesis of Software Systems, Lecture Notes in Computer Science, vol. 215, Springer, 1986, pp. 9–23.

3. J.A. Bergstra, J.W. Klop, E.-R. Olderog, Failures without chaos: A new process semantics for fair abstraction, in: M. Wirsing (Ed.), Formal Description of Programming Concepts—III, IFIP, Elsevier Science Publishers B.V., 1987, pp. 77–103.

4. Structural operational semantics for weak bisimulation;Bloom;Theor. Comput. Sci.,1995

5. Bisimulation can’t be traced;Bloom;J. ACM,1995

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

1. Fair termination of binary sessions;Proceedings of the ACM on Programming Languages;2022-01-12

2. Minimal Translations from Synchronous Communication to Synchronizing Locks;Electronic Proceedings in Theoretical Computer Science;2021-08-23

3. A fixed-points based framework for compliance of behavioural contracts;Journal of Logical and Algebraic Methods in Programming;2021-04

4. Stubborn Sets, Frozen Actions, and Fair Testing;Fundamenta Informaticae;2021-01-13

5. INFERENCE SYSTEMS WITH CORULES FOR COMBINED SAFETY AND LIVENESS PROPERTIES OF BINARY SESSION TYPES;LOG METH COMPUT SCI;2021