Abstract
The subject of this paper is the confluence of finite semi-commutation systems. Confluence of such systems is proved to be a decidable property. Existence of finite complete presentations between trace monoids is proved to be reducible to the existence of a confluent semi-commutation system. Complexity results related to the preceding problems are proved: deciding the existence of finite complete presentations is Σ P2 -complete, whereas deciding confluence of semi-commutation systems is Co-NP-complete. Additionally, an open problem about trace synchronizations is solved to be Co-NP-complete.
(EXTENDED ABSTRACT)
This research has been supported by the Sonderforschungsbereich 0342 at the Technical University of Munich and by the EBRA working group No. 3166 ASMICS.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Clerbout. Commutations partielles et familles de langages. Thése, Université de Lille (France), 1984.
V. Diekert. Research topics in the theory of free partially commutative monoids. Bull. of the European Association for Theoretical Computer Science (EATCS), 40:479–491, Feb 1990.
V. Diekert and W. Vogler. Local checking of trace synchronizability. In M. Chytil et al., editors, Proceedings of the 13th Symposium on Mathematical Foundations of Computer Science (MFCS'88), Carlsbad (CSSR) 1988, Lecture Notes in Computer Science 324, pages 271–279. Springer, Berlin-Heidelberg-New York, 1988. Revised and extended version in Math. Syst. Theory 22: 161–175, 1989: On the synchronization of traces.
M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
M. Latteux. On semi-commutations. In M. Ito, editor, Proc. of the International Colloquium on Words, Languages and Combinatorics (Kyoto 1990). World Scientific, Singapore, 1990.
A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, Lecture Notes in Computer Science 255, pages 279–324, Springer, Berlin-Heidelberg-New York, 1987.
Y. Métivier and E. Ochmanski. On lexicographic semi-commutations. Inform. Proc. Letters, 26:55–59, 1987.
P. Narendran and F. Otto. Preperfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule. Inform. Proc. Letters, 29:125–130, 1988.
F. Otto. Finite canonical rewriting systems for congruences generated by concurrency relations. Math. Syst. Theory, 20:253–260, 1987.
Y. Roos and P.A. Wacrenier. Composition of two semi commutations. Report I.T. 193, University of Lille (France), 1990.
L.J. Stockmeyer. The polynomial time-hierarchy. Theoret. Comput. Sci., 3:1–22, 1976.
C. Wrathall. Complete sets and the polynomial-time hierarchy. Theoret. Comput. Sci., 3:23–33, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diekert, V., Ochmanski, E., Reinhardt, K. (1991). On confluent semi-commutations — Decidability and complexity results. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_137
Download citation
DOI: https://doi.org/10.1007/3-540-54233-7_137
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54233-9
Online ISBN: 978-3-540-47516-3
eBook Packages: Springer Book Archive