Abstract
We study the parallel complexity of two problems on concurrency: membership for firing sequences on Petri nets and trace equivalence for partially commutative monoids. Both of them can be solved in constant time by unbounded fan-in circuits with threshold gates. However, they cannot be solved in constant time by a PRAM algorithm.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
