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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
