Real-time logics: Complexity and expressiveness
type: Item
instance of: scholarly article
title: Real-time logics: Complexity and expressiveness
zbMATH Open document ID: 0791.68103
author: Rajeev Alur
author: Thomas A. Henzinger
published in: Information and Computation
publication date: 1993-12-06T00:00:00Z
review text: The authors consider the theory of timed state sequences which combines classical theory of infinite state sequences with a theory of discrete time, via a monotonic function that maps every state to its time. This is suitable for reasoning about real-time temporal systems. They showed to be able to identify two elementary real-time temporal logics as expressively complete fragments of the theory of timed state sequences, and they present tableau-based decision procedures for checking validity. Consequently, these two formalisms are well-suited for the specification and verification of real-time systems.
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 439987
zbMATH Keywords: propositional temporal logic
zbMATH Keywords: timed state sequences
zbMATH Keywords: real-time temporal systems
zbMATH Keywords: real-time temporal logics
zbMATH Keywords: specification
zbMATH Keywords: verification
reviewed by: Satoshi Miura
MaRDI profile type: Publication
OpenAlex ID: W2139891885
DOI: 10.1006/INCO.1993.1025
description: scientific article; zbMATH DE number 439987