Publisher
Springer Berlin Heidelberg
Reference35 articles.
1. S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53:225–241, 1987.
2. L. Aceto, B. Bloom, and F.W. Vaandrager. Turning SOS rules into equations. In Proceedings 7th Annual Symposium on Logic in Computer Science, Santa Cruz, California, pages 113–124. IEEE Computer Society Press, 1992. Full version available as CWI Report CS-R9218, June 1992, Amsterdam. Invited to the LICS 92 Special Issue of Information and Computation.
3. K.R. Apt and G.D. Plotkin. Countable nondeterminism and random assignment. Journal of the ACM, 33(4):724–767, October 1986.
4. Lecture Notes in Computer Science;E. Badouel,1992
5. J.C.M. Baeten and J.A. Bergstra. Global renaming operators in concrete process algebra. Information and Computation, 78(3):205–245, 1988.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reactive bisimulation semantics for a process algebra with timeouts;Acta Informatica;2022-04-08
2. Stronger Validity Criteria for Encoding Synchrony;The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy;2019
3. Rule Formats for Bounded Nondeterminism in Structural Operational Semantics;Semantics, Logics, and Calculi;2015-12-25
4. CCS: It’s not fair!;Acta Informatica;2015-03-19
5. Non-deterministic structures of computation;Mathematical Structures in Computer Science;2014-11-10