Infinite series-parallel posets: Logic and languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 648-662

  Kuske, Dietrich ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

FINITE SERIES; INFINITE SERIES; MONADIC SECOND-ORDER LOGIC; POMSETS;

COMPUTER CIRCUITS;

EID: 84974604631     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_55     Document Type: Conference Paper

References (22)

1. S.L. Bloom and Z. Ésik. Shuffle binoids. Theoretical Informatics and Applications, 32:175-198, 1998.
2. B. Courcelle. The monadic second-order logic of graphs. I: Recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
3. V. Diekert and A. Muscholl. Deterministic asynchronous automata for infinite traces. Acta Informatica, 31:379-397, 1994.
4. V. Diekert and G. Rozenberg. The Book of Traces. World Scientific Publ. Co., 1995.
5. M. Droste, P. Gastin, and D. Kuske. Asynchronous cellular automata for pomsets. Theoretical Comp. Science, 1999. To appear.
6. W. Ebinger and A. Muscholl. Logical definability on infinite traces. Theoretical Comp. Science, 154:67-84, 1996.
7. Z. Ésik and S. Okawa. Series and parallel operations on pomsets. In Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comp. Science vol. 1738. Springer, 1999.
8. P. Gastin and A. Petit. Infinite traces. In [4], pages 393-486. 1995.
9. P. Gastin, A. Petit, and W. Zielonka. An extension of Kleene’s and Ochmanski’s theorems to infinite traces. Theoretical Comp. Science, 125:167-204, 1994.
10. J.L Gischer. The equational theory of pomsets. Theoretical Comp. Science, 61:199-224, 1988.
11. J. Grabowski. On partial languages. Ann. Soc. Math. Pol. IV: Fund. Math., 4(2):427-498, 1981.
12. H.J. Hoogeboom and G. Rozenberg. Dependence graphs. In [4], pages 43-67. 1995.
13. D. Lapoire. Recognizability equals monadic second order definability, for sets of graphs of bounded tree width. In STACS’98, Lecture Notes in Comp. Science vol. 1373, pages 618-628. Springer, 1998.
14. K. Lodaya and P. Weil. A Kleene iteration for parallelism. In V. Arvind and R. Ramanujam, editors, FST and TCS 98, Lecture Nodes in Computer Science vol. 1530, pages 355-366. Springer, 1998.
15. K. Lodaya and P. Weil. Series-parallel posets: algebra, automata and languages. In M. Morvan, Ch. Meinel, and D. Krob, editors, STACS98, Lecture Nodes in Computer Science vol. 1373, pages 555-565. Springer, 1998.
16. K. Lodaya and P. Weil. Series-parallel languages and the bounded-width property. Theoretical Comp. Science, 1999. to appear.
17. D. Perrin and J.-E. Pin. Mots Infinis. Tech. Rep. LITP 93.40, Université Paris 7 (France), 1993. Book to appear.
18. V. Pratt. Modelling concurrency with partial orders. Int. J. of Parallel Programming, 15:33-71, 1986.
19. F.P. Ramsey. On a problem of formal logic. Proc. London Math. Soc., 30:264-286, 1930.
20. M. Takahashi. The greatest fixed-points and rational omega-tree languages. Theoretical Comp. Science, 44:259-274, 1986.
21. W. Thomas. On logical definability of trace languages. In V. Diekert, editor, Proc. of the workshop Algebraic Methods in Computer Science, Kochel am See, FRG, pages 172-182, 1990. Report TUM-I9002, TU Munich.
22. W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. - Informatique Théorique et Applications, 21:99-135, 1987