Model Checking Branching Time Logics

Ph. Schnoebelen

doi:10.1109/time.2007.52

ScienceGate Book Chapters

JOURNAL ARTICLE

Model Checking Branching Time Logics

Ph. Schnoebelen

Year: 2007 Pages: 5-5

DOI: 10.1109/time.2007.52

Get Full-Text PDF Get Analytical Report

Abstract

Branching-time logics are temporal logics that allow quantification over possible futures. Such logics have been considered very early by the automated verification community because efficient model-checking algorithms for logics like CTL could be easily implemented and were used successfully.

Keywords:

Model checking Branching (polymer chemistry) Computer science Computation tree logic Temporal logic Futures contract T-norm fuzzy logics Theoretical computer science Monoidal t-norm logic Algorithm Artificial intelligence

Metrics

Cited By

1.36

FWCI (Field Weighted Citation Impact)

Refs

0.80

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Formal Methods in Verification

Physical Sciences → Computer Science → Computational Theory and Mathematics

Logic, programming, and type systems

Physical Sciences → Computer Science → Artificial Intelligence

Model-Driven Software Engineering Techniques

Physical Sciences → Computer Science → Software

Model Checking Branching Time Logics

Abstract

Metrics

Topics

Related Documents

Model checking for hybrid branching-time logics

Model Checking Games for Branching Time Logics

Temporal Logics for Linear and Branching Time and Model Checking

A New Approach to Bounded Model Checking for Branching Time Logics

Branching-Time Probalistic Model Checking.