Aperiodic Languages in Concurrency Monoids

Information and Computation

Volumn 126, Issue 2, 1996, Pages 105-113

  Droste, Manfred ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006323667     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0039     Document Type: Article

References (36)

1. [BDu] Bachmann, P., and Dung, Phan Minh (1986), Nondeterministic computations - Structure and axioms, Elektron. Inf. verarb. Kybern. EIK 22, 243-261.
2. [Be] Bednarczyk, M. (1987), "Categories of Asynchronous Systems," Ph.D. Thesis, Univ. of Sussex.
3. [BL] Berry, G., and Levy, J.-J. (1979), Minimal and optimal computations of recursive programs, J. Assoc. Comput. Mach. 26, 148-175.
4. [BDR] Börger, E., Durdenovic, I., and Rosenzweig, D. (1994), Occam: Specification and compiler correctness, part I. The primary model, in "Programming Concepts, Methods and Calculi" (U. Montanari and E.-R. Olderog, Eds.), pp. 489-508, NorthHolland, Amsterdam.
5. [BC] Boudol, G., and Castellani, I. (1988), A non-interleaving semantics for CCS based on proved transitions, Fundam. Inform. 11, 433-452.
6. [BD1] Bracho, F., and Droste, M. (1993), From domains to automata with concurrency, in "20th ICALP," Lecture Notes in Computer Science, Vol. 700, pp. 669-681, Springer, New York.
7. [BD2] Bracho, F., and Droste, M. (1994), Labelled domains and automata with concurrency, Theoret. Comp. Science 135, 289-318.
8. [BDK] Bracho, F., Droste, M., and Kuske, D., Representation of computations in concurrent automata, Theoret. Comp. Sci., to appear.
9. [CP] Cori, R., and Perrin, D. (1985), Automates et commutations partielles, RAIRO-Inform. Theor. Appl. 19, 21-32.
10. Diekert, V. (1990), "Combinatorics on Traces," Lecture Notes in Computer Science, Vol. 454, Springer, New York.
11. [DR] Diekert, V., and Rozenberg, G. (1995), "The Book of Traces," World Scientific, Singapore.
12. [D1] Droste, M. (1990), Concurrency, automata and domains, in "17th ICALP," Lecture Notes in Computer Science, Vol. 443, pp. 195-208, Springer, New York.
13. [D2] Droste, M. (1992), Concurrent automata and domains, Internat. J. Found. Comput. Sci. 3, 389-418.
14. [D3] Droste, M. (1995), Recognizable languages in concurrency monoids, Theoret. Comp. Sci. 150, 77-109.
15. [DK] Droste, M., and Kuske, D., On logical definability of languages in concurrency monoids, in: CSL '95, Springer, New York, in press.
16. [DS] Droste, M., and Shortt, R. M., (1993), Petri nets and automata with concurrency relations - An adjunction, in "Semantics of Programming Languages and Model Theory" (M. Droste and Y. Gurevich, Eds.), pp. 69-87, Gordon and Breach, Reading, MA.
17. [EM] Ebinger, W., and Muscholl, A. (1993), Logical definability on infinite traces, in "20th ICALP," Lecture Notes in Computer Science, Vol. 700, pp. 335-346, Springer, New York.
18. [Ei] Eilenberg, S. (1976), "Automata, Languages and Machines," Vol. B, Academic Press, New York.
19. [Gu] Guaiana, G. (1994), "Parties recconnaissables et morphismes sur les monoides traces," These, Université Paris 7, Paris.
20. [GRS] Guaiana, G., Restivo, A., and Salemi, S. (1992), Star-free trace languages, Theoret. Comput. Svi. 97, 301-311.
21. [HL] Huet, G., and Lévy, J.-J. ( 1979), "Call-by-Need Computations in Non-ambiguous Linear Term Rewriting Systems," Report 359, IRIA-LABORIA.
22. [KP] Katz, S., and Peled, D. (1990), Defining conditional independence using collapses, in "Semantics for Concurrency" (M. Z. Kwiatkowska, M. W. Shields, and R. M. Thomas, Eds.), Proc. of the Int. BCS-FACS Workshop at Leicester, pp. 262-280, Springer, New York.
23. [Ku] Kuske, D. (1994), Nondeterministic automata with concurrency relations, in "Colloquium on Trees in Algebra and Programming (CAAP)," Lecture Notes in Computer Science, Vol. 787, pp. 202-217, Springer, New York.
24. [Le] Lévy, J.-J. (1980), Optimal reductions in the lambda calculus, in "To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism" (J. P. Seldin and J. R. Hindley, Eds.), pp. 159-191, Academic Press, New York.
25. [Ma] Mazurkiewicz, A. (1977), "Concurrent Program Schemes and Their Interpretations," DAIMI Report PB-78, Aarhus Univ., Aarhus.
26. [MP] McNaughton, R., and Papert, S. (1971), "Counter-Free Automata," MIT Press, Cambridge, MA.
27. [Och] Ochmanski, E. (1985), Regular behaviour of concurrent systems, Bull. European Assoc. Theoret. Comput. Sci. 27, 56-67.
28. [PSt] Panangaden, P., and Stark, E. W. (1988), Computations, residuals and the power of indeterminacy, in "15th ICALP," Lecture Notes in Computer Science, Vol. 317, pp. 439-454, Springer, New York.
29. [Pe] Perrin, D. (1990), Finite Automata, in "Handbook of Theoretical Computer Science," pp. 1-57, Elsevier, Amsterdam.
30. [Seh] Schützenberger, M. P. (1965), On finite monoids having only trivial subgroups, Inform, and Control 8, 190-194.
31. [Sh] Shields, M. W. (1985), Concurrent machines, Comput. J. 28, 449-465.
32. [St1] Stark, E. W. (1989), Concurrent transition systems, Theoret. Comp. Sci. 64, 221-269.
33. [St2] Stark, E. W. (1989), Connections between a concrete and an abstract model of concurrent systems, in "5 th Conference on the Mathem. Foundations of Programming Semantics," Lecture Notes in Computer Science, Vol. 442, pp. 53-79, Springer, New York.
34. [St3] Stark, E. W. (1989), Compositional relational semantics for indeterminate dataflow networks, in "Proc., Category Theory and Computer Science," Lecture Notes in Computer Science, Vol. 389, pp. 52-74, Springer, New York.
35. [Th] Thomas, W. (1990), On logical definability of trace languages, in "Proc. of the workshop 'Algebraic Methods in Computer Science,' Kochel am See, FRG (1989)" (V. Diekert, Ed.), pp. 172-182, Report TUM-I9002, TU München.
36. [WN] Winskel, G., and Nielsen, M., Models for Concurrency, draft copy of Oct. 1991, in "Handbook of Logic in Computer Science" (S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, Eds.), Oxford Univ. Press, to appear.