Construction of deterministic transition graphs from dynamic integrity constraints

DOI10.1007/3-540-50728-0_41MaRDI QIDQ6199462zbMATH OpenOpenAlexFDO

Authors Udo W. Lipeck

Publication date 28 February 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-50728-0_41

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Monitoring dynamic integrity constraints based on temporal logic
• Transformation of dynamic integrity constraints into transaction specifications
• scientific article; zbMATH DE number 42840
• Deriving optimized integrity monitoring triggers from dynamic integrity constraints
• Theoretical foundations of handling large substitution sets in temporal integrity monitoring

Cites work

• Automatic verification of finite-state concurrent systems using temporal logic specifications
• scientific article; zbMATH DE number 3825144 (Why is no real title available?)
• scientific article; zbMATH DE number 3985193 (Why is no real title available?)
• Monitoring dynamic integrity constraints based on temporal logic
• Synthesis of Communicating Processes from Temporal Logic Specifications
• Temporal aspects of logical procedure definition
• Temporal logic can be more expressive
• The complexity of propositional linear temporal logics
• The INFOLOG linear tense propositional logic of events and transactions

This page was built for publication: Construction of deterministic transition graphs from dynamic integrity constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199462)