Oracle circuits for branching-time model checking

Authors:
Philippe Schnoebelen
Affiliations:
Lab. Spécification & Véérification, ENS de Cachan & CNRS, UMR, Cachan Cedex, France
Venue:
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Year:
2003

Citing 15
Cited 1

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Modalities for model checking: branching time logic strikes back

Science of Computer Programming
More complicated questions about maxima and minima, and some closures of NP

Theoretical Computer Science
Specifying real-time properties with metric temporal logic

Real-Time Systems
Bounded query classes

SIAM Journal on Computing
A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
NP trees and Carnap's modal logic

Journal of the ACM (JACM)
Model checking

Model checking
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
The complexity of propositional linear temporal logics in simple cases

Information and Computation
On Model Checking Durational Kripke Structures

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures

Efficient timed model checking for discrete-time systems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive queries to an NP oracle. This framework allows us to evaluate the precise computational complexity of model checking for some branching-time logics where it was known that the problem is NP-hard and coNP-hard.