Published in: LIPIcs, Volume 279, 34th International Conference on Concurrency Theory (CONCUR 2023)
Roland Guttenberg, Mikhail Raskin, and Javier Esparza. Geometry of Reachability Sets of Vector Addition Systems. In 34th International Conference on Concurrency Theory (CONCUR 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 279, pp. 6:1-6:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{guttenberg_et_al:LIPIcs.CONCUR.2023.6, author = {Guttenberg, Roland and Raskin, Mikhail and Esparza, Javier}, title = {{Geometry of Reachability Sets of Vector Addition Systems}}, booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-299-0}, ISSN = {1868-8969}, year = {2023}, volume = {279}, editor = {P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.6}, URN = {urn:nbn:de:0030-drops-190005}, doi = {10.4230/LIPIcs.CONCUR.2023.6}, annote = {Keywords: Vector Addition System, Petri net, Reachability Set, Almost hybridlinear, Partition, Geometry} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Javier Esparza, Mikhail Raskin, and Christoph Welzel. Regular Model Checking Upside-Down: An Invariant-Based Approach. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 23:1-23:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{esparza_et_al:LIPIcs.CONCUR.2022.23, author = {Esparza, Javier and Raskin, Mikhail and Welzel, Christoph}, title = {{Regular Model Checking Upside-Down: An Invariant-Based Approach}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {23:1--23:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.23}, URN = {urn:nbn:de:0030-drops-170862}, doi = {10.4230/LIPIcs.CONCUR.2022.23}, annote = {Keywords: parameterized verification, structural analysis, regular languages, regular model-checking, traps} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Mikhail Raskin, Chana Weil-Kennedy, and Javier Esparza. Flatness and Complexity of Immediate Observation Petri Nets. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 45:1-45:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{raskin_et_al:LIPIcs.CONCUR.2020.45, author = {Raskin, Mikhail and Weil-Kennedy, Chana and Esparza, Javier}, title = {{Flatness and Complexity of Immediate Observation Petri Nets}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {45:1--45:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.45}, URN = {urn:nbn:de:0030-drops-128574}, doi = {10.4230/LIPIcs.CONCUR.2020.45}, annote = {Keywords: Petri Nets, Reachability Analysis, Parameterized Verification, Flattability} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Mikhail Raskin. A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 138:1-138:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{raskin:LIPIcs.ICALP.2018.138, author = {Raskin, Mikhail}, title = {{A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {138:1--138:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.138}, URN = {urn:nbn:de:0030-drops-91428}, doi = {10.4230/LIPIcs.ICALP.2018.138}, annote = {Keywords: unambiguous automata, language complement, lower bound} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Mikhail Raskin. A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 88:1-88:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{raskin:LIPIcs.ICALP.2017.88, author = {Raskin, Mikhail}, title = {{A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {88:1--88:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.88}, URN = {urn:nbn:de:0030-drops-74105}, doi = {10.4230/LIPIcs.ICALP.2017.88}, annote = {Keywords: binary counter, data structure, integer representation, bit-probe model, lower bound} }
Feedback for Dagstuhl Publishing