Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota. Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. In Joost-Pieter Katoen, Barbara König, editors, CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings. Volume 6901 of Lecture Notes in Computer Science, pages 528-542, Springer, 2011. [doi]

This author has not been identified. Look up 'Wojciech Czerwinski' in GoogleThis author has not been identified. Look up 'Piotr Hofman' in GoogleThis author has not been identified. Look up 'Slawomir Lasota' in Google

runs on WebDSL