Reachability in fixed dimension vector addition systems with states

10 May 2020 Czerwiński Wojciech Lasota Sławomir Lazić Ranko Leroux Jérôme Mazowiecki Filip

The reachability problem is a central decision problem for formal verification based on vector addition systems with states (VASS), which are equivalent to Petri nets and form one of the most studied and applied models of concurrency. Reachability for VASS is also inter-reducible with a plethora of problems from a number of areas of computer science... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • FORMAL LANGUAGES AND AUTOMATA THEORY