Symbolic Model Checking of Real-Time Systems

Authors:
G. Logothetis;K. Schneider
Affiliations:
-;-
Venue:
TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Year:
2001

Citing 0
Cited 4

Generating Formal Models for Real-Time Verification by Exact Low-Level Runtime Analysis of Synchronous Programs

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Forward symbolic model checking for real time systems

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
An Automata-based Approach for CTL*; With Constraints

Electronic Notes in Theoretical Computer Science (ENTCS)
UPPAAL in practice: quantitative verification of a RapidIO network

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new real-time temporal logic for the specification and verification of discrete quantitative temporal properties. This logic is an extension of the well-known logic CTL. Its semantics is defined on discrete time transition systems which are in turn interpreted in an abstract manner instead of the usual stuttering interpretation. Hence, our approach directly supports abstractions of real-time systems by ignoring irrelevant qualitative properties, but without loosing any quantitative information. We analyse the complexity of the presented model checking algorithm and furthermore present a fragment of the logic that can be efficiently checked.