Logical definability on infinite traces

Theoretical Computer Science

Volumn 154, Issue 1, 1996, Pages 67-84

  Ebinger, Werner ^a   Muscholl, Anca ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT ENGINEERING; FORMAL LANGUAGES; GRAPH THEORY; MATHEMATICAL MODELS; SET THEORY;

INFINITE TRACES; LOGICAL DEFINABILITY; RECOGNIZABILITY; RECOGNIZABLE LANGUAGES;

EQUIVALENCE CLASSES;

EID: 0029754405     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00130-1     Document Type: Article

References (30)

1. IJ.J. Aalbersberg, U. Rozenberg, Theory of traces, Theoret. Comput. Sci. 60 (1988) 1-82.
2. A.V. Anisimov, D.E. Knuth, Inhomogeneous sorting, Int. J. Comput. Inform. Sci. 8 (1979) 255-260.
3. A. Arnold, A syntactic congruence for rational ω-languages. Theoret. Comput. Sci. 39 (1985) 333-335.
4. J.R. Büchi, On a decision method in restricted second order arithmetic, in: E. Nagel et al., eds., Proc. Internat. Congress on Logic, Methodology and Philosophy of Science (Stanford Univ. Press, Stanford, CA, 1960) 1-11.
5. P. Cartier and D. Foata, Problèmes Combinatoires de Commutation et Réarrangements, Lecture Notes in Mathematics, Vol. 85 (Springer, Berlin, 1969).
6. V. Diekert, Combinatorics on Traces, Lecture Notes in Computer Science, Vol. 454 (Springer, Berlin, 1990).
7. V. Diekert, On the concatenation of infinite traces, Theoret. Comput. Sci. 113 (1993) 35-54 (Special issue STACS'91).
8. V. Diekert and W. Ebinger, ed., Infinite Traces, Proc. workshop of the ESPRIT Basic Research Action, No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS), Tübingen, Germany, 1992, Bericht 4/92, Universität Stuttgart, Fakultät Informatik (1992).
9. V. Diekert and A. Muscholl, Deterministic asynchronous automata for infinite traces, Acta Informa. 31 (1994) 379-397, A preliminary version was presented at STACS'93, Lecture Notes in Computer Science, Vol. 665 (Springer, Berlin, 1993).
10. V. Diekert and A. Muscholl, Deterministic asynchronous automata for infinite traces, Acta Informa. 31 (1994) 379-397, A preliminary version was presented at STACS'93, Lecture Notes in Computer Science, Vol. 665 (Springer, Berlin, 1993).
11. V. Diekert and G. Rozenberg, eds. The Book of Traces (World Scientific, Singapore, 1995).
12. W. Ebinger, Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken, Dissertation, Institut für Informatik, Universität Stuttgart, 1994.
13. P. Gastin, Recognizable and rational trace languages of finite and infinite traces, in: C. Choffrut et al., eds., Proc. 8th Ann. Symp. on Theoretical Aspects of Computer Science (STACS'91), Hamburg 1991, Lecture Notes in Computer Science, Vol. 480 (Springer, Berlin, 1991) 89-104.
14. P. Gastin and A. Petit, Asynchronous automata for infinite traces, in: W. Kuich, ed., Proc. 19th Internat. Colloq. on Automata, Languages and Programming (ICALP'92), Vienna (Austria) 1992, Lecture Notes in Computer Science, Vol. 623 (Springer, Berlin, 1992) 583-594.
15. P. Gastin, A. Petit and W. Zielonka, An extension of Kleene's and Ochmański's theorems to infinite traces, Theoret. Comput. Sci. 125 (1994) 167-204; A preliminary version was presented at ICALP'91, Lecture Notes in Computer Science, Vol. 510 (Springer, Berlin, 1991).
16. P. Gastin, A. Petit and W. Zielonka, An extension of Kleene's and Ochmański's theorems to infinite traces, Theoret. Comput. Sci. 125 (1994) 167-204; A preliminary version was presented at ICALP'91, Lecture Notes in Computer Science, Vol. 510 (Springer, Berlin, 1991).
17. G. Guaiana, A. Restivo and S. Salemi, Star-free trace languages, Theoret. Comput. Sci. 97 (1992) 301-311, A preliminary version was presented at STACS'91, Lecture Notes in Computer Science, Vol. 480 (Springer, Berlin, 1991).
18. G. Guaiana, A. Restivo and S. Salemi, Star-free trace languages, Theoret. Comput. Sci. 97 (1992) 301-311, A preliminary version was presented at STACS'91, Lecture Notes in Computer Science, Vol. 480 (Springer, Berlin, 1991).
19. A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Report PB 78, Aarhus University, Aarhus, 1977.
20. A. Mazurkiewicz, Trace theory, in: W. Brauer et al., eds., Petri Nets, Applications and Relationship to other Models of Concurrency, Lecture Notes in Computer Science, Vol. 255 (Springer, Berlin, 1987) 279-324.
21. Y. Métivier, Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif, R.A.I.R.O. - Inform. Théorique et Appl. 20 (1986) 121-127.
22. E. Ochmański, Regular behaviour of concurrent systems. Bull. Eur. Assoc. Theoret. Comput. Sci. (EATCS) 27 (1985) 56-67.
23. D. Perrin, Recent results on automata and infinite words, in: M.P. Chytil and V. Koubek, editors, Proc. 11th Symp. on Mathematical Foundations of Computer Science (MFCS'84), Praha (CSFR) 1984, Lecture Notes in Computer Science, Vol. 176 (Springer, Berlin, 1984) 134-148.
24. D. Perrin and J.-E. Pin, First-order logic and star-free sets, J. Comput. System Sci. 32 (1986) 393-406.
25. D. Perrin and J. E. Pin, Mots Infinis, Tech. Report LITP 93.40, Université Paris 7 (France), 1993, Book to appear.
26. M.P. Schützenberger, On finite monoids having only trivial subgroups, Informat. Control 8 (1965) 190-194.
27. W. Thomas, Automata on infinite objects, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Ch. 4, (Elsevier, Amsterdam, 1990) 133-191.
28. W. Thomas, On logical definability of trace languages, in: V. Diekert, ed., Proc. workshop of the ESPRIT Basic Research Action, No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS), Kochel am See, Bavaria, FRG (1989), Report TUM-I9002, Technical University of Munich, (1990) 172-182.
29. W. Zielonka, Notes on finite asynchronous automata. R.A.I.R.O. - Inform. Théorique Appl. 21 (1987) 99-135.
30. W. Zielonka, Safe executions of recognizable trace languages by asynchronous automata, in: A.R. Mayer et al., eds., Proc. Symp. on Logical Foundations of Computer Science, Logic at Botik '89, Pereslavl-Zalessky (USSR) 1989, Lecture Notes in Computer Science, Vol. 363 (Springer, Berlin, 1989) 278-289.