On some equations in free partially commutative monoids
Theoretical Computer Science
On the Knuth-Bendix completion for concurrent processes
14th International Colloquium on Automata, languages and programming
Information Processing Letters
Combinatorics on traces
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Synchronized rational relations of finite and infinite words
Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Regular languages defined with generalized quantifiers
Information and Computation
The first-order theory of linear one-step rewriting is undecidable
Theoretical Computer Science - Special issue on rewriting techniques and applications
Solving word equations modulo partial commutations
Theoretical Computer Science
Counting modulo quantifiers on finite structures
Information and Computation - Special issue: LICS 1996—Part 1
Logics capturing local properties
ACM Transactions on Computational Logic (TOCL)
The Book of Traces
Confluence problems for trace rewriting systems
Information and Computation
Some Decision Problems for Traces
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
On the Confluence of Trace Rewriting Systems
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We prove that the first-order theory of the one-step rewriting relation associated with a trace rewriting system is decidable and give a nonelementary lower bound for the complexity. The decidability extends known results on semi-Thue systems but our proofs use new methods; these new methods yield the decidability of local properties expressed in first-order logic augmented by modulo-counting quantifiers. Using the main decidability result, we describe a class of trace rewriting systems for which the confluence problem is decidable. The complete proofs can be found in the Technical Report [14].