Branching-Time Temporal Logics with Minimal Model Quantifiers

@inproceedings{Mogavero2009BranchingTimeTL,
  title={Branching-Time Temporal Logics with Minimal Model Quantifiers},
  author={Fabio Mogavero and Aniello Murano},
  booktitle={Developments in Language Theory},
  year={2009}
}
Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the correctness of a system with respect to its desired behavior (specification), by verifying whether a model of the system satisfies a temporal logic formula modeling the specification. From a practical point of view, a very challenging issue in using temporal logic in formal verification is to come out with techniques that… 

Logics in Computer Science

Four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior are introduced and examined.

Reasoning About Substructures and Games

This article presents and study a new branching-time temporal logic, called Substructure Temporal Logic (STL * for short), whose distinctive feature is to allow for quantifying over the possible substructure of a given structure.

Minimisation of Models Satisfying CTL Formulas

This work develops a procedure computing all minimisations of a given finite pointed Kripke model satisfying a given CTL formula, and illustrates it with some examples, and provides some complexity analysis for it.

Conformance Tester for STP-ISS Protocol Implementation Based on Formal Model

  • N. ChumakovaV. Olenev
  • Computer Science
    2018 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)
  • 2018
This paper presents Software-to-hardware Tester, intended for conformance testing of STP-ISS-13 protocol implementation, based on a formal model, which considers a process of conformation testing by means of computational tree temporal logic and a compilation example of temporal logic formula for a protocol requirement.

References

SHOWING 1-10 OF 62 REFERENCES

On the Complexity of Branching Modular Model Checking (Extended Abstract)

This paper considers assume-guarantee specifications in which the assumptions and the guarantees are specified by universal branching temporal formulas (i.e., all path quantifiers are universal), and classifies the complexity of satisfiability, validity, implication, and modular model checking for both ∀CTL and ∀ CTL*.

Sometimes and Not Never Re-revisited: On Branching Versus Linear Time

Two approaches that relate branching and linear model checking are described, one motivated by the fact that the alternation-free Μ-calculus, which is more expressive than CTL, has the same computational advantage as CTL when it comes to model checking.

Decision procedures and expressiveness in the temporal logic of branching time

It is established that CTL has the small property by showing that any satisfiable CTL formulae is satisfiable in a small finite model obtained from a small -&-ldquo;pseudo-model-&-rdquo%; resulting from the Fischer Ladner quotient construction.

Graded Computation Tree Logic

It is proved that, although GCTL is more expressive than CTL, the satisfiability problem for GCTP remains solvable in ExpTime, and it is shown that G CTL is exponentially more succinct than graded mu-calculus.

Modular Model Checking

This paper considers assume-guarantee specifications in which the guarantee is specified by branching temporal formulas, and shows that modular model checking is PSPACE-complete for ∀CTL and is EXPSPACE- complete for ∄CTL*.

An automata-theoretic approach to branching-time model checking

It is shown that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics, and can be used to obtain optimal decision procedures and make it possible to derive optimal model-checking algorithms.

Model Checking and Satisfiability for Sabotage Modal Logic

It is shown that the formula complexity and the program complexity are linear, resp.

An automata-theoretic approach to modular model checking

It is proved that when the assumption is linear, these bounds hold also for guarantees in CTL and CTL*, and the problem remains EXSPACE-hard even when the assumptions are restricted to LTL and the guarantees are taken as a fixed <inline-equation> ∀</f> </inline-Equation>CTL formula.

Alternating-time temporal logic

This work introduces a third, more general variety of temporal logic: alternating-time temporal logic 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.

Module Checking

This paper introduces and examines the problem of model checking of open systems (module checking), and shows that while module checking and model checking coincide for the linear-time paradigm, module checking is much harder than model checking for the branching- time paradigm.
...