Languages and logical definability in concurrency monoids

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

Volumn 1092, Issue , 1996, Pages 233-251

  Droste, Manfred ^a   Kuske, Dietrich ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; RECONFIGURABLE HARDWARE; SET THEORY;

BINARY RELATION; DEFINABILITY; FINITE COMPUTATIONS; FIRST ORDER; LABELED TRANSITION SYSTEMS; MONADIC SECOND-ORDER LOGIC; PARTIALLY ORDERED SET; TRACE THEORY;

COMPUTER CIRCUITS;

EID: 84957705972     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61377-3_41     Document Type: Conference Paper

References (35)

1. AALBERSBERG, I.J. and G. ROZENBERG: Theory of traces. Theor. Comp. Science 60 (1988), 1-82.
2. Bednarczyk, M.: Categories of asynchronous systems. Ph.D. thesis, Univer­sity of Sussex, 1987.
3. Berry, G.: Stable models of typed λ-calculi. In: 5th ICALP, Lect. Notes in Comp. Science vol. 62, Springer, 72-89, 1978.
4. Boldi, P., F. CARDONBand 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 Science Publ., OPA Amsterdam, 1993, pp. 89-108.
5. BORGER, E. and D. ROSENZWEIG: Occam: Specification and compiler correct­ness. Part I: Simple mathematical interpreters. To appear.
6. 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.
7. Bracho, F. and M. DROSTE: Labelled domains and automata with concur­rency. Theor. Comp. Science 135 (1994), '289-318.
8. Bracho, F M. Droste and D. KUSKE: Dependence orders for compu­tations of concurrent automata. In: STACS’95, Lecture Notes in Computer Science vol. 900, Springer 1995, 467-678.
9. Bracho, F., M. Droste and D. Kuske: Representation of computations in concurrent automata by dependence orders. Theor. Comp. Science, 1996, to appear.
10. Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6 (1960), 66-92.
11. CURIEN, P.L.: Categorical Combinators, Sequential Algorithms and Func­tional Programming. Progress in Theoretical Computer Science, Birkhauser, Boston, 1993.
12. DIEKERT, V.: Combinatorics on Traces. Lecture Notes in Computer Science vol. 454, Springer, 1990.
13. V. DIEKERT and Y. Métivier: Partial commutation and traces. In: G. Rosen­berg and A. Salomaa: Handbook on Formal Languages vol. 3, Springer, to appear, 1996.
14. DIEKERT, V. and G. ROZENBERG: The Book of Traces. World Scientific Publ. Co., 1995.
15. DROSTE, M.: Concurrency, automata and domains. In: 17th ICALP, Lecture Notes in Computer Science vol. 443, Springer, 1990, pp. 195-208.
16. Droste, M.: Concurrent automata and domains. Intern. J. of Found, of Coxnp. Science 3 (1992), 389-418.
17. Droste, M.: A Kleene theorem for recognizable languages over concurrency monoids. In: 21st ICALP, Lecture Notes in Computer Science vol. 820, Springer 1994, pp. 388-399.Full version: Recognizable languages m concurrency monoids, Theor. Comp. Science 150 (1996), pp. 77-109.
18. DROSTE, M.: Aperiodic languages over concurrency monoids. Information and Computation, 1996, to appear.
19. DROSTE, M. and D. Kuske: Recognizable and logically definable languages of infinite computations in concurrency monoids. Technical report, Inst, fur Algebra, TU Dresden, 1995, submitted.
20. EBINGER, W. and A. MUSCHOLL: Logical definability on infinite traces. In: 20th ICALP, Lecture Notes in Computer Science vol. 700, Springer, 1993, pp. 335-346.
21. Guaiana, G., A. RESTIVO and S. SALEMI: Star-free trace languages. Theor. Comp. Science 97 (1992), 301-311.
22. KUSKE, D.: Modelle nebenlaufiger Prozesse - Monoide, Residuensysterne und Automaten. Dissertation, Universitat GH Essen, 1994.
23. KUSKE, D. Nondeterministic automata with concurrency relations. Collo­quium on Trees in Algebra and Programming, Lecture Notes in Computer Science vol. 787, Springer, 1994, 202-217.
24. MAZURKIEWICZ, A.: Csoncurrent program schemes and their interpretation. DAIMI Report PB-78, Aarhus University, Aarhus, 1977.
25. MAZURKIEWICZ, A.: Trace theory. In: Advanced Course on Petri Nets, Lecture Notes in Computer Science, Springer, 1986, pp. 279-324.
26. MAZURKIEWICZ, A.: Basic notions of trace theory. In: Linear Time, Branch­ing Time and Partial Order in Logics and Models for Concurrency (J.YV. de Bakker, W.-P. de Roever, G. Rozenberg), Lecture Notes in Computer Science vol. 354, Springer, 1988, pp. 285-363.
27. McNaughton, R. and S. PaPERT: Counter-free Automata. MIT-Press, Cam­bridge, USA, 1971.
28. OcHMANSKl, E.: Regular behaviour of concurrent systems, Bull. Europ. Assoc, for Theoret. Comp. Science 27 (1985), 56-67.
29. Panangaden, P., V. Shanbhogue and E.W. Stark: Stability and sequen- tiability in dataflow networks. In: 17th ICALP, Lecture Notes in Computer Science vol. 443, Springer, 1990, pp. 308-321.
30. SHIELDS, M.W.: Concurrent machines. Computer Journal 28 (1985), 449-465.
31. STARK, E.W.: Connections between a concrete and an abstract model of con­current systems. In: Proceedings of the 5th Conf. on the Mathematical Founda­tions of Programming Semantics, Lecture Notes in Computer Science vol. 389, Springer, 1989, pp. 52-74.
32. Stark, E.W.: Compositional relational semantics for indeterminate dataflow networks. In: Proc. Category Theory and Computer Science, Lecture Notes in Computer Science vol. 389, Springer, 1989, pp. 52-74.
33. Thomas, W.: Automata on Infinite Objects. In: Handbook of Theoretical Com- puter Science (J. van Leeuwen, ed.), Elsevier Science Publ. B.V., 1990, pp. 133-191.
34. Thomas, W.: On logical definability of trace languages. In: Proc. of the work­shop Algebraic Methods in Computer Science, Kochel am See, FRG (1989) (V. Diekert, ed.). Report TU\1-19002, TU Munich, 1990, pp. 172-182.
35. Winskel, G. and M. Nielsen: Models for concurrency. In: Handbook of Logic in Computer Science (S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, eds.), to appear.