Browse by Person
![]() | Up a level |
Number of items: 1.
Paulevé, L. ; Andrieux, G. ; Koeppl, H. (2013):
Under-approximating cut sets for reachability in large scale automata Networks.
8044, pp. 69-84, Springer, 25th International Conference on Computer Aided Verification (CAV 2013), [Conference or Workshop Item]