Nondeterministic automata with concurrency relations and domains-Reference-Cited by-同舟云学术

Nondeterministic automata with concurrency relations and domains

Published: Issue: Volume: Page:202-217
ISSN:
Container-title:Trees in Algebra and Programming — CAAP'94
language:
Short-container-title:

Author:

Kuske Dietrich

Publisher

Springer-Verlag

Link

http://www.springerlink.com/index/pdf/10.1007/BFb0017483

Reference23 articles.

1. Boldi, P., F. Carbone and N. Sabadini: Concurrent automata, prime event structures and universal domains, In: Semantics of Programming Languages and Model Theory, (M. Droste, Y. Gurevich, eds.), Gordon and Breach Publ., OPA Amsterdam, 1993, pp. 89–108.

2. Bracho, F. and M. Droste: From domains to automata with concurrency. In: 20th ICALP, Lecture Notes in Computer Science vol. 700, Springer, 1993, pp. 669–681.

3. Bracho, F. and M. Droste: Labelled domains and automata with concurrency. To appear in Theoretical Computer Science, 1994.

4. Berry, G.: Stable models of typed λ-calculi. In: 5th ICALP, Lecture Notes in Computer Science vol. 62, Springer, 1978, pp. 72–89.

5. Coquand, T.: Categories of embeddings. In: 3rd Annual Symposium on Logic in Computer Science (Y. Gurevich, ed.), IEEE Computer Society, 1988.

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

1. DIRECTED HOMOTOPY IN NON-POSITIVELY CURVED SPACES;LOG METH COMPUT SCI;2020

2. Asynchronous games 2: The true concurrency of innocence;Theoretical Computer Science;2006-08

3. Concurrent Automata vs. Asynchronous Systems;Mathematical Foundations of Computer Science 2005;2005

4. On Recognizable Stable Trace Languages;Lecture Notes in Computer Science;2000

5. RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA;International Journal of Foundations of Computer Science;1998-09