Ranko Lazić
Abstract
Notwithstanding the rapid recent progress in settling the very high computational complexity of the reachability problem, VASS (also known as Petri nets) remain an intriguing model of concurrency with extensive significance for verification and synthesis. In this engaging article, Tony introduces us to asymptotic analysis of VASS, showing that many relevant problems have attractive complexities, and concluding with several inviting directions for further investigations.
Index Terms
- Verification column
Recommendations
Verification column
The growing popularity of verification competitions such as VerifyThis Verification Competition and the Competition on Software Verification (SV-COMP), both, incentivize as well as reward tool developers. VerifyThis 2016 was held in Eindhoven colocated ...
Guest Column: One-Tape Turing Machine Variants and Language Recognition
We present two restricted versions of one-tape Turing machines. Both characterize the class of context-free languages. In the first version, proposed by Hibbard in 1967 and called limited automata, each tape cell can be rewritten only in the first d ...
Automata column
For the Automata Theory Column, we have an article by B. Srivathsan on the reachability problem in timed automata. Ever since timed automata were introduced by Alur and Dill, they have been widely used in the verification of real-time systems. Their ...
Comments