A Kleene theorem for recognizable languages over concurrency monoids

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

Volumn 820 LNCS, Issue , 1994, Pages 388-399

  Droste, Manfred ^a,b  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

BINARY RELATION; FINITE COMPUTATIONS; KLEENE THEOREM; LABELLED TRANSITION SYSTEMS; MONOIDS; RECOGNIZABLE LANGUAGES; TRACE THEORY;

ALGEBRA;

EID: 84957688351     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58201-0_84     Document Type: Conference Paper

References (33)

1. I. J. Aalbersberg, G. Rozenberg: Theory of traces, Theoret. Comp. Science 60 (1988), 1-82.
2. P. Bachmann, Phan Minh Dung: Nondeterministic computations - structure and axioms, Elektron. Inf.verarb. Kybern. EIK 22 (1986), 243-261.
3. M. Bednarczyk: Categories of asynchronous systems, PhD Thesis, University of Sussex, 1987.
4. G. Berry, J.-J. Levy: Minimal and optimal computations of recursive programs, J. ACM 26 (1979), 148-175.
5. E. Börger, D. Rosenzweig: Occam: Specification and compiler correctness. Part I: Simple mathematical interpreters, to appear.
6. G. Boudol, I. Castellani: A non-interleaving semantics for CCS based on proved transitions, Fundam. Inform. 11 (1988), 433-452.
7. F. Bracho, M. Droste: From domains to automata with concurrency, in: 20th ICALP, Lecture Notes in Computer Science, vol. 700, Springer, 1993, pp. 669-681.
8. F. Bracho, M. Droste: Labelled domains and automata with concurrency, Theoret. Comp. Science, to appear.
9. J.R. Büchi: On a decision method in restricted second order arithmetics, in: Proc. Intern. Congress on Logic, Methodology and Philosophy of Science (E. Nagel et al., eds.), Stanford University Press, Stanford, 1960, pp. 1-11.
10. R. Cori, Y. Métivier: Recognizable subsets of some partially abelian monoids, Theoret. Comp. Science 35 (1985), 241-254.
11. R. Cori, D. Perrin: Automates et commutations partielles, R.A.I.R.O. Informatique Théorique et Applications 19 (1985), 21-32.
12. V. Diekert: ”Combinatorics on Traces”, Lecture Notes in Computer Science, vol. 454, Springer, 1990.
13. M. Droste: Concurrency, automata and domains, in: 17th ICALP, Lecture Notes in Computer Science, vol. 443, Springer, 1990, pp. 195-208.
14. M. Droste: Concurrent automata and domains, Intern. J. of Foundations of Comp. Science 3 (1992), 389-418.
15. M. Droste: Recognizable languages over concurrency monoids, to appear.
16. M. Droste, R.M. Shortt: Petri nets and automata with concurrency relations - an adjunction, in: “Semantics of Programming Languages and Model Theory” (M. Droste, Y. Gurevich, eds.), Gondon and Breach Science Publ., Reading, 1993, pp. 69-87.
17. G. Guaiana, A. Restivo, S. Salemi: Star-free trace languages, Theoret. Comp. Science 97 (1992), 301-311.
18. G. Huet, J.-J. Levy: Call-by-need computations in non-ambiguous linear term rewriting systems, IRIA-LABORIA Report 359 (1979).
19. S. Katz, D. Peled: “Defining conditional independence using collapses”, in: “Semantics for Concurrency” (M.Z. Kwiatkowska, M.W. Shields, R.M. Thomas, eds.), Proc. of the Int. BCS-FACS Workshop at Leicester, 1990, Springer, pp. 262-280.
20. D. Kuske: Nondeterministic automata with concurrency relations, in: Colloquium on Trees in Algebra and Programming 1994, Lecture Notes in Computer Science, Springer, 1994, to appear.
21. J.-J. Levy: Optimal reductions in the lambda calculus, in: “To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism” (J.P. Seldin, J.R. Hindley, eds.), Academic Press, New York, 1980, pp. 159-191.
22. A. Mazurkiewicz: Concurrent program schemes and their interpretations, DAIMI Report PB-78, Aarhus University, Aarhus, 1977.
23. Y. Métivier: Une condition suffisante de reconnaissabilité dans un monoide partiellement commutatif, R.A.I.R.O.-Informatique Théorique et Applications 20 (1986), 121-127.
24. E. Ochmanski: Regular behaviour of concurrent systems, Bull. Europ. Assoc. for Theoret. Comp. Science 27 (1985), 56-67.
25. P. Panangaden, E.W. Stark: Computations, residuals and the power of indeterminacy, in: 15th ICALP, Lecture Notes in Computer Science, vol. 317, Springer, 1988, pp. 439-454.
26. M.O. Rabin: Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1-35.
27. M.P. Schützenberger: On the definition of a family of automata, Inf. Control 4 (1961), 245-270.
28. M.W. Shields: Concurrent machines, Comp. J. 28 (1985), 449-465.
29. E.W. Stark: Concurrent transition systems, Theoret. Comp. Science 64 (1989), 221-269.
30. E.W. Stark: Connections between a concrete and an abstract model of concurrent systems, in: 5th Conference on the Mathem. Foundations of Programming Semantics, Lecture Notes in Computer Science, vol. 442, 1989, pp. 53-79.
31. E.W. Stark: 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.
32. G. Winskel, M. Nielsen: “Models for Concurrency”, draft copy of Oct. 1991”, in: “Handbook of Logic in Computer Science” (S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, eds.), to appear.
33. W. Zielonka: Notes on finite asynchronous automata, R.A.I.R.O. Informatique Théorique et Applications 21 (1987), 99-135.