Journal article
Eliminating the storage tape in reachability constructions
Theoretical computer science, Vol.299(1-3), pp.687-706
04/18/2003
Handle:
https://hdl.handle.net/2376/103331
Abstract
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton can be accepted by a two-tape pushdown acceptor with reversal-bounded counters. We improve this result by showing that the stack can be eliminated from the acceptor, i.e., the binary reachability can be accepted by a two-tape finite-state acceptor with reversal-bounded counters. We also obtain similar results for other machine models. Our results can be used to verify certain properties concerning these machines that were not verifiable before using previous techniques. For example, we are able to formulate a subset of Presburger LTL that is decidable for satisfiability checking with respect to these machines. We also discuss the “boundedness problem” for reachability sets. Finally, we explain how the storage tape elimination technique can be applied to machines with real-valued clocks.
Metrics
6 Record Views
Details
- Title
- Eliminating the storage tape in reachability constructions
- Creators
- Oscar H Ibarra - Department of Computer Science, University of California, Santa Barbara, CA 93106, USAZhe Dang - School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA 99164, USA
- Publication Details
- Theoretical computer science, Vol.299(1-3), pp.687-706
- Academic Unit
- Electrical Engineering and Computer Science, School of
- Publisher
- Elsevier B.V
- Identifiers
- 99900546701401842
- Language
- English
- Resource Type
- Journal article