Past pushdown timed automata and safety verification

@article{Dang2004PastPT,
  title={Past pushdown timed automata and safety verification},
  author={Zhe Dang and Tevfik Bultan and Oscar H. Ibarra and Richard A. Kemmerer},
  journal={Theor. Comput. Sci.},
  year={2004},
  volume={313},
  pages={57-71}
}
We consider past pushdown timed automata that are discrete pushdown timed automata with past formulas as enabling conditions. Using past formulas allows a past pushdown timed automaton to access the past values of the finite state variables in the automaton. We prove that the reachability (i.e., the set of reachable configurations from an initial configuration) of a past pushdown timed automaton can be accepted by a nondeterministic reversal-bounded counter machine augmented with a pushdown… CONTINUE READING

Similar Papers

Loading similar papers…