The Complexity of Reachability in Affine Vector Addition Systems with
  States

Titel:: The Complexity of Reachability in Affine Vector Addition Systems with States
Dokumenttyp:: Zeitschriftenaufsatz
Autor(en):: Blondin, Michael; Raskin, Mikhail
Zeitschriftentitel:: Logical Methods in Computer Science
Jahr:: 2021
Band / Volume:: Volume 17, Issue 3
Volltext / DOI:: doi:10.46298/lmcs-17(3:3)2021
Verlag / Institution:: Centre pour la Communication Scientifique Directe (CCSD)
E-ISSN:: 1860-5974
Publikationsdatum:: 20.07.2021
BibTeX

Vorkommen: