A polynomial-time algorithm for reachability in branching VASS in dimension one
- Submitting institution
-
University College London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 14723
- Type
- E - Conference contribution
- DOI
-
10.4230/LIPIcs.ICALP.2016.105
- Title of conference / published proceedings
- Leibniz International Proceedings in Informatics, LIPIcs
- First page
- 1
- Volume
- 55
- Issue
- -
- ISSN
- 1868-8969
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The decidability of reachability in Branching VASS is one of the major open problems in theoretical computer science ( cf. Sec. 6 in Link https://doi.org/10.1145/2677161.2677163 ). This first-ever decidability result has since been extended (e.g. Figueira et al., ICALP’17; Clemente et al., LICS’17). The encouraging results obtained in this article were taken as a basis for an €320,000 ANR project on Branching VASS ( Link https://anr.fr/Project-ANR-17-CE40-0028 ).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -