scispace - formally typeset
Open Access

An Automata-Theoretic Approach to Automatic Program Verification

About
The article was published on 1986-01-01 and is currently open access. It has received 1275 citations till now. The article focuses on the topics: Automata theory & State (computer science).

read more

Citations
More filters
Journal ArticleDOI

A theory of timed automata

TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Journal ArticleDOI

The model checker SPIN

TL;DR: An overview of the design and structure of the verifier, its theoretical foundation, and an overview of significant practical applications are given.
Journal ArticleDOI

Alternating-time temporal logic

TL;DR: This work introduces a third, more general variety of temporal logic: alternating-time temporal logic, which offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves.
Journal ArticleDOI

A logic for reasoning about time and reability

TL;DR: This work presents a logic for stating properties such as, “after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds” and gives algorithms for checking that a given Markov chain satisfies a formula in the logic.