A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (VPA) by Alur and Madhusudan and event-clock automata (ECA) by Alur, Fix and Henzinger. VPA and ECA-by making the call-return edges visible and by making the clock-reset operation visible, respectively-recover decidability for the verification problem for pushdown automata implementation against visibly pushdown automatadoi:10.1007/978-3-319-30000-9_7 fatcat:e5a345g5fbbapkyriexzp2wnke