@inproceedings{leroux_et_al:LIPIcs:2016:5702,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Petri net, ideal, well-quasi-order, reachability, verification},
Author = {Leroux, J{\'e}r{\^o}me and Schmitz, Sylvain},
BookTitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
Editor = {Ollinger, Nicolas and Vollmer, Heribert},
File = {2 (0) - a - a - l.pdf},
ISBN = {978-3-95977-001-9},
ISSN = {1868-8969},
Pages = {1:1--1:13},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Ideal Decompositions for Vector Addition Systems (Invited Talk)}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5702},
Volume = {47},
Year = {2016},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2016/5702},
bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.STACS.2016.1},
date-added = {2017-06-01 13:56:12 +0000},
date-modified = {2017-06-01 13:56:12 +0000},
urn = {urn:nbn:de:0030-drops-57024},
doi = {10.4230/LIPIcs.STACS.2016.1}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A