Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Uli Schlachter and Harro Wimmel. k-Bounded Petri Net Synthesis from Modal Transition Systems. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{schlachter_et_al:LIPIcs.CONCUR.2017.6, author = {Schlachter, Uli and Wimmel, Harro}, title = {{k-Bounded Petri Net Synthesis from Modal Transition Systems}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {6:1--6:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-048-4}, ISSN = {1868-8969}, year = {2017}, volume = {85}, editor = {Meyer, Roland and Nestmann, Uwe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.6}, URN = {urn:nbn:de:0030-drops-77802}, doi = {10.4230/LIPIcs.CONCUR.2017.6}, annote = {Keywords: Modal transition system, bounded Petri net, synthesis} }
Feedback for Dagstuhl Publishing