A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
[chapter]
2006
Lecture Notes in Computer Science
We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied preorders and equivalences like simulation, completed simulation, ready simulation, 2-nested simulation preorders/equivalences and bisimulation equivalence. Our main results are
doi:10.1007/11874683_6
fatcat:nk77bhingvf6rmftggjjw5blkm