A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One (2016)
Attributed to:
Counter Automata: Verification and Synthesis
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Publication URI: http://drops.dagstuhl.de/opus/volltexte/2016/6240/
Type: Conference/Paper/Proceeding/Abstract
Volume: Leibniz International Proceedings in Informatics (LIPIcs) 55