Testability of oracle automata

Authors:
Gaoyan Xie;Cheng Li;Zhe Dang
Affiliations:
School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA;School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA;School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA
Venue:
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Year:
2004

Citing 5
Cited 0

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking

Model checking
Black Box Checking

FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
AMC: An Adaptive Model Checker

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Model checking and testing combined

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

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.