Concurrent regular expressions and their relationship to Petri nets
Theoretical Computer Science
Decidability Questions for Bismilarity of Petri Nets and Some Related Problems
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Petri Nets and the Equivalence Problem
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
An algebraic system for process structuring and interprocess communication
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The modeling and analysis of supervisory systems
The modeling and analysis of supervisory systems
Computation: finite and infinite machines
Computation: finite and infinite machines
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Software Descriptions with Flow Expressions
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
The shuffle operator models communication free concurrency and has little expressive power (it does not produce new languages when added to regular expressions). Decidability problems for languages involving this operation were previously tackled but remained unsolved (except for a weak conjecture). We prove that language equivalence is undecidable even for a very restricted class of expressions involving the shuffle operator. This also re-proves that language equivalence is undecidable for Basic Parallel Processes.