Abstract
An oracle finite automaton (OFA) is a finite/Buchi automaton augmented with a finite number of unbounded, one-way, and writable query tapes. By each transition, an OFA can read an input symbol, append a symbol to the end of a query tape, erase the content of a query tape, or query an oracle with the content of a query tape (called a query string). Here, an oracleO is a language in some language class \(\mathcal{O}\) (all oracles in the OFA must be in the same language class \(\mathcal{O}\), and we denote such OFAs with OFA\(^\mathcal{O}\). The name of “oracle” comes from the fact that, except for its language class, the definition of O is not given. However, the oracle O can always be queried with the answer whether a query string w is in O.
The research was supported in part by NSF Grant CCF-0430531.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finitestate concurrent systems using temporal logic specifications. TOPLAS 8(2), 244–263 (1986)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)
Groce, A., Peled, D., Yannakakis, M.: Amc: An adaptive model checker. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 521–525. Springer, Heidelberg (2002)
Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines - A survey. Proceedings of the IEEE 84, 1090–1126 (1996)
Peled, D.: Model checking and testing combined. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 47–63. Springer, Heidelberg (2003)
Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: FORTE/PSTV 1999, pp. 225–240 (1999)
Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: LICS 1986, pp. 332–344 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xie, G., Li, C., Dang, Z. (2005). Testability of Oracle Automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-30500-2_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24318-2
Online ISBN: 978-3-540-30500-2
eBook Packages: Computer ScienceComputer Science (R0)