Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Combinatorics on traces
Makanin's algorithm is not primitive recursive
Theoretical Computer Science
Solving word equations modulo partial commutations
Theoretical Computer Science
Satisfiability of equations in free groups is in PSPACE
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Book of Traces
Some Decision Problems for Traces
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
Makanin's Algorithm for Word Equations - Two Improvements and a Generalization
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Existential and Positive Theories of Equations in Graph Products
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Algorithms for Normal Curves and Surfaces
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Logspace computations in graph groups and coxeter groups
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 0.00 |
Trace monoids are well-studied objects in computer science where they serve as a basic algebraic tool for analyzing concurrent systems. The question whether the existential theory of trace equations is decidable has been solved positively in 1996. Free partially commutative groups (graph groups) generalize trace monoids in the sense that every element has an inverse. In this paper we show that the existential theory of equations over graph groups is decidable, too. Our decision procedure is non-elementary, but if a certain graph theoretical parameter is viewed as a constant, then we obtain a PSPACE-completeness result. Restricting ourselves to trace monoids we still obtain a better complexity result, as it was known previously.