Deterministic asynchronous automata for infinite traces-Reference-Cited by-同舟云学术

Deterministic asynchronous automata for infinite traces

Published:1994-04 Issue:4 Volume:31 Page:379-397
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Diekert Volker,Muscholl Anca

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

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

Reference18 articles.

1. [Arn85] Arnold, A.: A syntactic congruence for rational ?-languages. Theoret. Comput. Sci.39, 333?335 (1985)

2. Lect. Notes Math.;P. Cartier,1969

3. [CMZ89] Cori, R., Métivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Tech. rep. 89-97, LABRI, Univ. Bordeaux, 1989

4. [CP85] Cori, R., Perrin, D.: Automates et commutations partielles. R.A.I.R.O.?Inf. Théor. Appl.19, 21?32 (1985)

5. Lect. Notes Comput. Sci.;V. Diekert,1990

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

1. Process-commutative distributed objects: From cryptocurrencies to Byzantine-Fault-Tolerant CRDTs;Theoretical Computer Science;2024-11

2. Classifying recognizable infinitary trace languages using word automata;Information and Computation;2017-10

3. Classifying Recognizable Infinitary Trace Languages Using Word Automata;Mathematical Foundations of Computer Science 2014;2014

4. Toward a Structure Theory of Regular Infinitary Trace Languages;Automata, Languages, and Programming;2014

5. On Distributed Monitoring of Asynchronous Systems;Logic, Language, Information and Computation;2012