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

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]

Abstract

Abstract is missing.