Monitoring dynamic integrity constraints based on temporal logic

doi:10.1016/0306-4379(87)90004-4

Information Systems

Volume 12, Issue 3, 1987, Pages 255-269

https://doi.org/10.1016/0306-4379(87)90004-4 Get rights and content

Abstract

Dynamic integrity constraints are used to specify admissible sequences of database states. We present algorithmic fundamentals of monitoring constraints expressed in temporal logic. The essential means are finite transition graphs which can be constructed from temporal formulae by utilizing an appropriate normalform. To ensure admissibility of a state sequence, the integrity monitor has to follow a corresponding path through the graph and to check certain nontemporal conditions in each state; these conditions are provided as edge labels. Thus, monitoring dynamic integrity is reduced to a controlled checking of static integrity. All errors in present database behaviour are detected as well as many inevitable future errors.

References (34)

A Sernadas
Temporal aspects of logical procedure definition
Inform. Systems
(1980)
J Fiadeiro et al.
The INFOLOG linear tense propositional logic of events and transactions
Inform. Systems
(1986)
U Schiel et al.
Towards multi-level and modular conceptual schema specifications
Inform. Systems
(1984)
W Weber et al.
Integrity checking in data-base systems
Inform. Systems
(1983)
J.M.V deCastilho et al.
A temporal framework for database specifications
M.A Casanova et al.
On the description of database transition constraints using temporal languages
M.A Casanova et al.
Formal database specification—an eclectic perspective
C.H Kung
A temporal framework for database specification and verification
H.-D Enrich et al.
Specification, semantics and enforcement of dynamic database constraints
U.W Lipeck et al.
Specifying admissibility of dynamic database behaviour using temporal logic

A.L Furtado et al.

Formal Techniques for Data Base Design

(1986)

T.L Anderson

Modelling time at the conceptual level

U Schiel

The time dimension in information systems

K.P Eswaran et al.

Functional specifications of a subsystem for data base integrity

M Stonebraker

Implementation of integrity constraints and views by query modification

P.A Bernstein et al.

Fast maintenance of semantic integrity assertions using redundant aggregate data

J.-M Nicolas

Logic for improving integrity checking in relational data bases

Acta Inform.

(1982)

Cited by (59)

The OO-Method approach for information systems modeling: From object-oriented conceptual modeling to automated programming
2001, Information Systems
Current and future (conventional) notations used in Conceptual Modeling Techniques should have a precise (formal) semantics to provide a well-defined software development process, in order to go from specification to implementation in an automated way. To achieve this objective, the OO-method approach to Information Systems Modeling presented in this paper attempts to overcome the conventional (informal)/formal dichotomy by selecting the best ideas from both approaches. The OO-method makes a clear distinction between the problem space (centered on what the system is) and the solution space (centered on how it is implemented as a software product). It provides a precise, conventional graphical notation to obtain a system description at the problem space level, however this notation is strictly based on a formal OO specification language that determines the conceptual modeling constructs needed to obtain the system specification. An abstract execution model determines how to obtain the software representations corresponding to these conceptual modeling constructs. In this way, the final software product can be obtained in an automated way.
General treatment of dynamic integrity constraints
2000, Data and Knowledge Engineering
This paper introduces a general, set-theoretic model for expressing dynamic integrity constraints, i.e., integrity constraints on the state changes that are allowed in a given state space. In a managerial context, such dynamic integrity constraints can be seen as representations of “real world” constraints and business rules. This topic has important practical applications in many business areas. The notions of (direct) transition, reversible and irreversible transition, transition relation, and consistency of a transition relation will be introduced. The expected link with Kripke models (for modal and temporal logics) is also made explicit. Several practical examples of dynamic integrity constraints will illustrate the applicability of the theory. Some important subclasses of dynamic integrity constraints in a database context will be identified, e.g., various forms of cumulativity (which can be regarded as “transitional” inclusion dependencies concerning two different “points in time”), non-decreasing values, integrity constraints on initial and final values, life cycles, changing life cycles, and transition and constant dependencies. Several formal properties of these dependencies will be derived. For instance, it turns out that functional dependencies can be considered as “degenerated” transition dependencies. Also, the distinction between primary keys and alternate keys is reexamined, from a dynamic point of view.
Real-time event control in active databases
1998, Journal of Systems and Software
Most existing languages for the specification of active rules are based on the ECA (event-condition-action) paradigm. Usually, rules specified by such languages are triggered by simple events like the update of a tuple in a relational database. We present a specification language that can be used to specify real-time triggering conditions in terms of complex event patterns. Our specification language can be used to formulate complex, triggering conditions for active rules in terms of event patterns that involve sequences, alternations, iterations, and parallel compositions. Also, the language can be used to specify soft, real-time constraints with respect to the minimum/maximum time required/allowed between pairs of events. Our language is designed to be flexible and general in the sense that it can be combined with most ECA rule languages. We formally define the syntax and semantics of the language and we illustrate its use by means of examples.
A first step towards implementing dynamic algebraic dependences
1998, Theoretical Computer Science
We present a class of dynamic constraints (DADs) which are of practical interest and allows one to express restrictions such as if some property holds now, then in the past some other property should have been true. The paper investigates in a constructive manner the definition of transaction-based specifications equivalent to DAD-constraint-based specifications. Our study shows the limitation of Abiteboul/Vianu's transaction schemas and proposes a generalization of transaction schemas based on regular expression on transactions.
Reasoning about qualitative trends in databases
1998, Information Systems
We propose a temporal constraint, called trend dependency (TD), which captures a significant family of qualitative trends in databases. An important extension in comparison with existing temporal dependencies is that TDs allow attributes with linearly ordered domains to be compared over time by any operator of {<,=,>,⪯,≥,≠ n0 –} sound and complete axiomatization for logical implication of TDs is provided. The complexity of the logical implication problem for TDs is investigated. A comparison with related work is provided at the end of the paper. We show that TDs can express most temporal dependencies that have so far been proposed in the literature.
Deriving liveness goals from temporal logic specifications
1996, Journal of Symbolic Computation
A propositional temporal logic is briefly introduced and its use for reactive systems specification is motivated and illustrated. G-automata are proposed as a new operational semantics domain designed to cope with fairness/liveness properties. G-automata are a class of labelled transition systems with an additional structure of goal achievement which forces the eventual fulfilment of every pending goal. An algorithm is then presented, that takes a finite system specification as input and that, by a stepwise tableaux analysis method, builds up a canonical G-automaton matching the specification. Eventuality formulae correspond to goals of the automaton their satisfaction being thus assured. The direct execution of G-automata, and consequently of specifications, is then discussed and suggested as an alternative approach to the execution of propositional temporal logic. A short overview of the advantages of applying the techniques to the specific field of database monitoring is presented.

View all citing articles on Scopus

View full text

Monitoring dynamic integrity constraints based on temporal logic

Abstract

Inform. Systems

Inform. Systems

Inform. Systems

Inform. Systems

A temporal framework for database specifications

On the description of database transition constraints using temporal languages

Formal database specification—an eclectic perspective

A temporal framework for database specification and verification

Specification, semantics and enforcement of dynamic database constraints

Specifying admissibility of dynamic database behaviour using temporal logic

Formal Techniques for Data Base Design

Modelling time at the conceptual level

The time dimension in information systems

Functional specifications of a subsystem for data base integrity

Implementation of integrity constraints and views by query modification

Fast maintenance of semantic integrity assertions using redundant aggregate data

Logic for improving integrity checking in relational data bases

Acta Inform.