A survey of recognizable languages with infinite traces
暂无分享,去创建一个
[1] Grzegorz Rozenberg,et al. Theory of Traces , 1988, Theor. Comput. Sci..
[2] Edward Ochmanski. Notes on a star mystery , 1990, Bull. EATCS.
[3] Edward Ochmanski,et al. Regular behaviour of concurrent systems , 1985, Bull. EATCS.
[4] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[5] Pierre Cartier,et al. Problemes combinatoires de commutation et rearrangements , 1969 .
[6] Ronald L. Graham,et al. Rudiments of Ramsey theory , 1981 .
[7] Jacques Sakarovitch,et al. On Regular Trace Languages , 1987, Theor. Comput. Sci..
[8] Yves Métivier,et al. On Recognizable Subsets of Free Partially Commutative Monoids , 1986, Theor. Comput. Sci..
[9] Paul Gastin,et al. Recognizable Complex Trace Languages , 1991, MFCS.
[10] Wieslaw Zielonka,et al. Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..
[11] Yves Métivier,et al. Asynchronous Mappings and Asynchronous Cellular Automata , 1993, Inf. Comput..
[12] Thomas Sudkamp,et al. Languages and Machines , 1988 .
[13] Volker Diekert,et al. Combinatorics on Traces , 1990, Lecture Notes in Computer Science.
[14] Robert Cori,et al. Automates et Commutations Partielles , 1985, RAIRO Theor. Informatics Appl..
[15] Paul Gastin,et al. A Kleene Theorem for Infinite Trace Languages , 1991, ICALP.
[16] A. Mazurkiewicz. Concurrent Program Schemes and their Interpretations , 1977 .
[17] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[18] Paul Gastin,et al. Infinite Traces , 1990, Semantics of Systems of Concurrent Processes.
[19] Yves Métivier,et al. Recognizable Subsets of Some Partially Abelian Monoids , 1985, Theor. Comput. Sci..
[20] Gérard Roucairol,et al. Maximal Serializability of Iterated Transactions , 1985, Theor. Comput. Sci..
[21] Wieslaw Zielonka. Safe Executions of Recognizable Trace Languages by Asynchronous Automata , 1989, Logic at Botik.
[22] Paul Gastin,et al. Asynchronous Cellular Automata for Infinite Traces , 1992, ICALP.
[23] YVES MÉTIVIER,et al. On the Star Operation in Free Partially Commutative Monoids , 1991, Int. J. Found. Comput. Sci..
[24] Paul Gatin. Recognizable and rational languages of finite an infinite traces , 1991 .
[25] Dominique Perrin,et al. Partial Commutations , 1989, ICALP.
[26] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[27] Volker Diekert. On the Concentration of Infinite Traces , 1993, Theor. Comput. Sci..
[28] Antoni W. Mazurkiewicz,et al. Trace Theory , 1986, Advances in Petri Nets.
[29] Volker Diekert. On the concatenation of infinite traces (extended abstract) , 1991 .
[30] Marta Z. Kwiatkowska,et al. A Metric for Traces , 1990, Inf. Process. Lett..
[31] Paul Gastin,et al. The Poset of Infinitary Traces , 1993, Theor. Comput. Sci..
[32] Marta Z. Kwiatkowska,et al. On the Domain of Traces and Sequential Composition , 1991, TAPSOFT, Vol.1.
[33] Raymond R. Devillers,et al. Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..
[34] André Arnold,et al. A Syntactic Congruence for Rational omega-Language , 1985, Theor. Comput. Sci..
[35] Paul Gastin,et al. An asychronous model for distributed systems (French) , 1990 .