The University of Warwick Library - WebBridge
The complexity of coverability in ν-Petri nets
Lazic,
Ranko.
31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
2016-07-05.
p.
467 -
476...
.
Online access not found
Sorry - based on the information provided, WebBridge cannot offer appropriate links.
- If online access is not found this means that the Library's subscriptions do not cover access to the article. You may still be able to access it online if there is an open access version available.
- Check availability in Library Search to confirm whether we have the print journal at the Library or if we have online access to the journal but not for the year you required.
- When the Library has no access to a specific print or online article you can use Get it for me! to request a copy.