Abstract
We present under the form of a survey some results obtained recently in the field of trace theory. In particular, we state and comment the fundamental theorem of Zielonka on asynchronous automata.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
4. Bibliography
Aalbersberg, I., Rozenberg, G., 1988, Theory of traces, Theoret. Comput. Sci., 60, 1–82.
Aalbersberg, I., Welzl, E., 1986, Trace languages defined by regular string languages, RAIRO Informat. Theor., 20, 103–119.
Anisimov, A.V. Knuth, D.E., 1979, Inhomogeneous sorting, Internat. J. Comput. Inform. Sci., 8, 255–260.
Bertoni, A., Mauri, G., Sabatini, N., 1982, Equivalence and membership problems for regular trace languages, in Automata, Languages and Programming, Lecture Notes in Comput. Science, 140, 61–71, Springer.
Carpi, A., De Luca, A., 1986, Square-free words on partially commutative free monoids, Inform. Process. Letters, 22, 125–132.
Cartier, P., Foata, D., 1969, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math., 85, Springer Verlag.
Choffrut, C., 1986, Free partially commutative monoids, LITP-report 86-20.
Cori, R., Métivier, Y., 1988, Approximation d'une trace, automates aysnchrones et ordre des évènements dans un système réparti, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 317, 147–161.
Cori, R., Perrin, D., 1985, Automates et commutations partielles, RAIRO Informat. Théor. 19, 21–32.
Diekert, V., 1988, Transitive orientations, Möbius functions and complete semi-Thue systems for partially commutative monoids, in Automata, Languages and Programming, Lecture Notes in Comput. Sci., 317, 176–187.
Duboc, C., 1986, On some equations in free partially commutative monoids, Theoret. Comput. Sci., 46, 159–174.
Flé, M.P., Roucairol, G., 1985, Maximal serializability of iterated transactions, Theoret. Comput. Sci., 38, 1–16.
Fliess, M., 1974, Matrices de Hankel, J. Math. Pures et Appl., 53, 197–224.
Hoare, C.A.R., 1978, Communicating sequential processes, Comm. ACM, 21, 666–677.
König, R., 1989, On free partially commutative monoids, preprint, University of Erlangen.
Lallement, G., 1979, Semigroups and Combinatorial Applications, Wiley.
Lamport, L., Lynch, N., 1989, Distributed Computing, in Handbook of Theoretical Computer Science, (J. van Leuwen ed.) North Holland, to appear.
Lothaire, M., 1983, Combinatorics on Words, Cambridge University Press.
Métivier, Y., 1986 a, On recognizable subsets in free partially commutative monoids, in Automata Languages and Programming, Lecture Notes in Comput. Sci., 226, 254–264.
Métivier, Y., 1986 b, Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif, RAIRO Informat. Théor., 20, 121–127.
Métivier, Y., 1987 a, Contribution à l'Etude des Monoïdes de Commutation, Thèse, Université de Bordeaux I.
Métivier, Y., 1987 b, An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs, in Automata, Languages and Programming, Lecture Notes in Comput. Sci., 267, 226–236.
Ochmanski, E., 1985, Regular trace languages, Ph. D. Thesis, Institute of Computer Science, Polish Academy of Sciences, Warsaw.
Perrin, D., 1985, Words over a partially commutative alphabet, in Combinatorial Algorithms on Words (A. Apostolico, Z. Galil eds.), Springer, 329–340.
Reisig, W., Petri Nets, an Introduction, Springer, 1982.
Sakarovitch, J., 1987, On regular trace languages, Theoret. Comput. Sci., 52, 59–75.
Zielonka, W., 1987, Notes on finite aysnchronous automata and trace languages, RAIRO Informat. Theoret. 21, 99–135.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perrin, D. (1989). Partial communations. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035789
Download citation
DOI: https://doi.org/10.1007/BFb0035789
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51371-1
Online ISBN: 978-3-540-46201-9
eBook Packages: Springer Book Archive