Theoretical foundations of handling large substitution sets in temporal integrity monitoring
type: Item
instance of: scholarly article
title: Theoretical foundations of handling large substitution sets in temporal integrity monitoring
zbMATH Open document ID: 0701.68022
DOI: 10.1007/BF01893887
author: Klaus Hülsmann
author: Gunter Saake
published in: Acta Informatica
publication date: 1991-01-01T00:00:00Z
review text: Temporal constraints can be expressed by temporal logic formulae which are satisfied in a database evolution if they are valid for all substitutions for their free variables. The technique to represent historical information relies on the fact that temporal formulae can be transformed into so-called transition graphs which are some kind of finite state machine and whose transition conditions are non-temporal formulae. This reduces the needed historical data to the information about which substitution is associated with which node of the transition graph. This technique is extended in order to get a more compact representation of the possibly infinite substitution sets. For this purpose substitutions are generalized to the notion of so-called descriptions which represent whole sets of substitutions. The notions of formula validity and of stepwise monitoring potential validity of temporal constraints are redefined for descriptions. Based on these notions an algorithm for monitoring temporal integrity by handling descriptions is presented. Finally, a syntactical characterization of the constraints which can be monitored with acceptable storage requirements is defined.
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 4149537
zbMATH Keywords: historical information
zbMATH Keywords: transition graphs
zbMATH Keywords: temporal integrity
MaRDI profile type: Publication
cites work: SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
cites work: Algebraic and operational semantics of specifications allowing exceptions and errors
cites work: Specification and verification of database dynamics
cites work: Proving Consistency of Database Transactions Written in Extended Pascal
cites work: Q3749040
cites work: Monitoring dynamic integrity constraints based on temporal logic
cites work: Synthesis of Communicating Processes from Temporal Logic Specifications
cites work: Q3349971
Recommended article: On the feasibility of checking temporal integrity constraints
Recommended article: Monitoring dynamic integrity constraints based on temporal logic
Recommended article: Scalable offline monitoring of temporal specifications
Recommended article: The properties of sets of temporal logic subformulas
Recommended article: Q4037099
Recommended article: Q4037388
Recommended article: Temporal Verification of Fault-Tolerant Protocols
Recommended article: On Stubborn Sets in the Verification of Linear Time Temporal Properties
Recommended article: On stubborn sets in the verification of linear time temporal properties
description: scientific article; zbMATH DE number 4149537