Author:
Bakker J. W.,Zucker J. I.
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. APT, K.R. & E.R. OLDEROG, Proof rules dealing with fairness, Proc. Logic of Programs 1981 (D. Kozen, ed.), 1–9, LNCS 131, Springer, 1982.
2. APT, K.R. & G.D. PLOTKIN, A Cook's tour of countable nondeterminism, Proc. 8th ICALP (S. Even & O. Kariv, eds), 479–494, LNCS 115, Springer, 1981.
3. ARNOLD, A., Topological characterizations of infinite behaviours of transition systems, Proc. 10th ICALP (J. Diaz, ed.), 28–38, LNCS 154, Springer, 1983.
4. ARNOLD, A. & M. NIVAT, Metric interpretations of infinite trees and semantics of nondeterministic recursive programs, Theoretical Computer Science 11, 181–206, 1980.
5. ARNOLD, A. M. NIVAT, The metric space of infinite trees, algebraic and topological properties, Fund. Inform. III, 4, 445–476, 1980.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献