Abstract
The decidability of the equivalence problem and the disjointness problem for regular trace languages is considered. By describing the structure of the independence relations involved, precise characterizations are given of those concurrency alphabets for which these problems are decidable. In fact, the first problem is decidable if and only if the independence relation is transitive, while the second problem is decidable if and only if the independence relation is a so-called transitive forest.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aalbersberg, IJ. J., and Engelfriet, J., The recognition of trace languages, Technical Report 86-18, University of Leiden, Leiden (1986).
Aalbersberg, IJ. J., and Hoogeboom, H. J., Decidability problems for regular trace language,Proc. ICALP 87 (Th. Ottmann, ed.), Lecture Notes in Computer Science, Vol. 267, Springer-Verlag, Berlin (1987), pp. 250–259.
Aalbersberg, IJ. J., and Rozenberg, G., Traces, dependency graphs and DNLC grammars,Discrete Appl. Math.,11 (1985), 299–306.
Aalbersberg, IJ. J., and Rozenberg, G., Theory of traces,Theoret. Comput. Sci.,60 (1988), 1–82.
Aalbersberg, IJ. J., and Welzl, E., Trace languages defined by regular string languages,RAIRO Inform. Théor.,20 (1986), 103–119.
Berstel, J.,Transductions and Context-Free Languages, Teubner, Stuttgart (1979).
Berstel, J., and Perrin, D.,Theory of Codes, Academic Press, New York (1985).
Bertoni, A., Brambilla, M., Mauri, G., and Sabadini, N., An application of the theory of free partially commutative monoids: asymptotic densities of trace languages,Proc. MFCS 81 (J. Gruska and M. Chytil, eds.), Lecture Notes in Computer Science, Vol. 118, Springer-Verlag, Berlin (1981), pp. 205–215.
Bertoni, A., Mauri, G., and Sabadini, N., Equivalence and membership problems for regular trace languages,Proc. ICALP 82 (M. Nielsen and E. M. Schmidt, eds.), Lecture Notes in Computer Science, Vol. 140, Springer-Verlag, Berlin (1982), pp. 61–71.
Bertoni, A., Mauri, G., and Sabadini, N., Unambiguous regular trace languages,Colloquia Mathematica Societas János Bolyai 42, North-Holland, Amsterdam (1985), pp. 113–123.
Berstel, J., and Sakarovitch, J., Recent results in the theory of rational sets,Proc. MFCS 86 (J. Gruska, B. Rovan, and J. Wiedermann, eds.), Lecture Notes in Computer Science, Vol. 233, Springer-Verlag, Berlin (1986), pp. 15–28.
Cartier, P., and Foata, D.,Problèmes combinatoires de commutations et réarrangements, Lecture Notes in Mathematics, Vol. 85, Springer-Verlag, Berlin (1969).
Choffrut, C., Free partially commutative monoids, Report 86-20, LITP, University of Paris 7, Paris (1986).
Chrobak, M., and Rytter, W., Unique decipherability for partially commutative monoids,Fund. Inform.,X (1987), 323–336.
Clerbout, M., and Latteux, M., Partial commutations and faithful rational transductions,Theoret. Comput. Sci.,34 (1984), 241–254.
Cori, R., and Metivier, Y., Recognizable subsets of some partially abelian monoids,Theoret. Comput. Sci.,35 (1985), 179–189.
Cori, R., and Perrin, D., Automates et commutations partielles,RAIRO Inform. Théor.,19 (1985), 21–32.
Duboc, C., Commutations dans les monoides libres: un cadre théorique pour l'étude du parallélisme, Thesis, University of Rouen, Rouen (1986).
Flé, M. P., and Roucairol, G., Fair serializability of iterated transactions using FIFO-nets,Advances in Petri Nets (G. Rozenberg, ed.), Lecture Notes in Computer Science, Vol. 188, Springer-Verlag, Berlin (1985), pp. 154–168.
Gibbons, A., and Rytter, W., On the decidability of some problems about rational subsets of free partially commutative monoids,Theoret. Comput. Sci.,48 (1986), 329–337.
Ginsburg, S.,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).
Harary, F.,Graph Theory, Addison-Wesley, Reading, MA (1969).
Harrison, M. A.,Introduction to Formal Language Theory, Addison-Wesley, Reading, MA (1978).
Hopcroft, J. E., and Ullman, J. D.,Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA (1979).
Ibarra, O. H., Reversal-bounded multicounter machines and their decision problems,J. Assoc. Comput. Mach.,25 (1978), 116–133.
Mazurkiewicz, A., Concurrent program schemes and their interpretations, DAIMI Report PB-78, Aarhus University, Arhus (1977).
Mazurkiewicz, A., Traces, histories, graphs: instances of a process monoid,Proc. MFCS 84 (M. P. Chytil and V. Koubek, eds.), Lecture Notes in Computer Science, Vol. 176 Springer-Verlag, Berlin (1984), pp. 115–133.
Mazurkiewicz, A., Semantics of concurrent systems: a modular fixed-point trace approach,Advances in Petri Nets (G. Rozenberg, ed.), Lecture Notes in Computer Science, Vol. 188, Springer-Verlag, Berlin (1985), pp. 353–375.
Métivier, Y., Une condition suffisante de reconnaissabilité dans un monoide partiellement commutatif,RAIRO Inform. Théor.,20 (1986), 121–127.
Minsky, M. L., Recursive unsolvability of Post's problem of “tag” and other topics in theory of Turing Machines,Ann. of Math.,74 (1961), 437–455.
Minsky, M. L.,Computation: Finite and Infinite Machines, Prentice-Hall, London (1967).
Sardinas, A. A., and Patterson, C. W., A necessary and sufficient condition for the unique decomposition of coded messages,I.R.E. Internat. Conv. Rec.,8 (1953), 104–108.
Wolk, E. S., A note on “The comparability graph of a tree”,Proc. Amer. Math. Soc.,16 (1965), 17–20.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aalbersberg, I.J., Hoogeboom, H.J. Characterizations of the decidability of some problems for regular trace languages. Math. Systems Theory 22, 1–19 (1989). https://doi.org/10.1007/BF02088289
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02088289