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.
8044Springer, In: 25th International Conference on Computer Aided Verification (CAV 2013), pp. 69-84, [Online-Edition: http://link.springer.com/chapter/10.1007%2F978-3-642-39799-8...],
[Conference or Workshop Item]

This list was generated on Tue Jul 7 01:13:00 2020 CEST.