TU Darmstadt / ULB / TUbiblio

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: No Grouping | Item Type | Date | Language
Number of items: 1.

Paulevé, L. and Andrieux, G. and 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]

This list was generated on Tue Jan 19 02:02:15 2021 CET.