Bisimilarity of One-Counter Processes Is PSPACE-Complete - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Stanislav Böhm, Stefan Göller, Petr Jancar. Bisimilarity of One-Counter Processes Is PSPACE-Complete. In Paul Gastin, François Laroussinie, editors, CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings. Volume 6269 of Lecture Notes in Computer Science, pages 177-191, Springer, 2010. [doi]

This author has not been identified. Look up 'Stanislav Böhm' in GoogleThis author has not been identified. Look up 'Stefan Göller' in GoogleThis author has not been identified. Look up 'Petr Jancar' in Google

runs on WebDSL