The Automata-Theoretic Approach to Verification of Reactive Systems

Authors:
A. N. Chebotarev
Affiliations:
Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2001

Citing 7
Cited 0

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Compositional model checking

Proceedings of the Fourth Annual Symposium on Logic in computer science
Mathematical logic for computer science

Mathematical logic for computer science
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
Modalities for model checking (extended abstract): branching time strikes back

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking

Symbolic Model Checking
Construction of an Automaton From a Formula of the Monadic First-Order Theory of Natural Numbers

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Basic problems related to the use of automata-theoretic methods of verification of reactive systems are considered; in particular, the construction of an automaton from a formula of a temporal logic and the reduction of the automaton being verified are described.