Construction of deterministic transition graphs from dynamic integrity constraints

DOI10.1007/3-540-50728-0_41OpenAlexW1530053583MaRDI QIDQ6199462

Unnamed Author, 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)

Cites Work

• The INFOLOG linear tense propositional logic of events and transactions
• Monitoring dynamic integrity constraints based on temporal logic
• Temporal aspects of logical procedure definition
• Temporal logic can be more expressive
• Synthesis of Communicating Processes from Temporal Logic Specifications
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• The complexity of propositional linear temporal logics
• Unnamed Item
• Unnamed Item

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