An efficiency preorder for processes-Reference-Cited by-同舟云学术

An efficiency preorder for processes

Published:1992-08 Issue:8 Volume:29 Page:737-760
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Arun-Kumar S.,Hennessy M.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

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

Reference15 articles.

1. Proc. International Conference on Theoretical Aspects of Computer Software;S. Arun-Kumar,1991

2. Beaton, J., Bergstra, J.: Real time process algebra, Technical Report CWI Amsterdam, 1989

3. Cleaveland, R., Parrow, J., Steffen, B.: The concurrency workbench: A semantics-based verification tool for finite-state systems, Technical Report ECS-LFCS-89-83, University of Edinburgh, 1989

4. Technical Report;J. Davies,1989

5. Gerth, R., Boucher, A.: A timed failures model for extended communicating sequential processes (Lect. Notes Comput. Sci., vol. 267, pp. 95?114. Berlin Heidelberg New York: Springer 1986

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

1. Processes against tests: On defining contextual equivalences;Journal of Logical and Algebraic Methods in Programming;2022-11

2. Modular coinduction up-to for higher-order languages via first-order transition systems;Logical Methods in Computer Science;2021-09-17

3. Unique solutions of contractions, CCS, and their HOL formalisation;Information and Computation;2020-12

4. Up-to Techniques for Branching Bisimilarity;SOFSEM 2020: Theory and Practice of Computer Science;2020

5. Comparing Process Calculi Using Encodings;Electronic Proceedings in Theoretical Computer Science;2019-08-22