Under-Approximating Cut Sets for Reachability in Large Scale Automata Networks - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Loïc Paulevé, Geoffroy Andrieux, Heinz Koeppl. Under-Approximating Cut Sets for Reachability in Large Scale Automata Networks. In Natasha Sharygina, Helmut Veith, editors, Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings. Volume 8044 of Lecture Notes in Computer Science, pages 69-84, Springer, 2013. [doi]

This author has not been identified. Look up 'Loïc Paulevé' in GoogleThis author has not been identified. Look up 'Geoffroy Andrieux' in GoogleThis author has not been identified. Look up 'Heinz Koeppl' in Google

runs on WebDSL