Skip to main content
SpringerLink
Log in

Construction of deterministic transition graphs from dynamic integrity constraints

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 344))

Included in the following conference series:

Abstract

Here systems, in particular database systems, are considered whose dynamic behaviour is characterized by state sequences that evolve stepwise, and whose integrity constraints are specified by means of temporal logic. Monitoring temporal formulae in state sequences can be reduced to following paths in transition graphs by only checking nontemporal edge labels in each state. This paper presents an algorithm how to construct deterministic transition graphs from temporal formulae in a bottom-up way corresponding to the formula structure. These graphs ensure at least provisional admissibility of system behaviour up to a present state and at most potential admissibility of future behaviour. Moreover, deterministic graphs have considerable advantages over general transition graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Castilho,J.M.V.de/ Casanova,M.A./ Furtado,A.L.: A Temporal Framework for Database Specifications. Proc. Int. Conf. on Very Large Data Bases 1982, 280–291

    Google Scholar 

  2. Clarke, E.M./ Emerson, E.A./ Sistla, A.P.: Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Trans. on Progr. Lang. and Sys. 8 (1986), 244–263

    Google Scholar 

  3. Feng,D.S./ Lipeck,U.W.: Monitoring Temporal Formulae Deterministically (in German). Informatik-Bericht Nr. 87-06, Techn. Univ. Braunschweig 1987

    Google Scholar 

  4. Fiadeiro, J./ Sernadas, A.: The INFOLOG Linear Tense Propositional Logic of Events and Transactions. Information Systems 11 (1986), 61–85

    Google Scholar 

  5. Kröger, F.: Temporal Logics of Programs. Springer-Verlag, Berlin 1987

    Google Scholar 

  6. Kung,C.H.: A Temporal Framework for Database Specification and Verification. Proc. Int. Conf. on Very Large Data Bases 1984, 91–99

    Google Scholar 

  7. Lipeck, U.W.: On Dynamic Integrity of Databases: Fundamentals of Specification and Monitoring (in German). Habilitation Thesis, Informatics, TU Braunschweig, 1987

    Google Scholar 

  8. Lipeck, U.W./ Ehrich, H.-D./ Gogolla, M.: Specifying Admissibility of Dynamic Database Behaviour Using Temporal Logic. Proc. IFIP Work. Conf. on Theoretical and Formal Aspects of Information Systems (A. Sernadas/ J. Bubenko/ A. Olive, eds.), North-Holland, Amsterdam 1985, 145–157

    Google Scholar 

  9. Lipeck, U.W./ Saake, G.: Monitoring Dynamic Integrity Constraints Based on Temporal Logic. Information Systems 12 (1987), 255–269

    Google Scholar 

  10. Manna, Z.: Verification of Sequential Programs: Temporal Axiomatization. In: Theoretical Foundations of Programming Methodology (M. Broy/ G. Schmidt, eds.) Reidel Publ. Co., Dordrecht 1982, 53–101

    Google Scholar 

  11. Manna,Z./ Pnueli,A.: Verification of Concurrent Programs: The Temporal Framework. In: The Correctness Problem in Computer Science (R.S.Boyer/ J.S.Moore, eds.), Academic Press, 1981, 215–273

    Google Scholar 

  12. Manna, Z./ Wolper, P.: Synthesis of Communicating Processes from Temporal Logic Specifications. ACM Trans. on Progr. Lang. and Sys. 6 (1984), 68–93

    Google Scholar 

  13. Saake, G./ Lipeck, U.W.: Foundations of Temporal Integrity Monitoring. Proc. IFIP Work. Conf. on Temporal Aspects in Information Systems 1987 (C. Rolland et al., eds.), North-Holland, Amsterdam 1988, 235–249

    Google Scholar 

  14. Sernadas, A.: Temporal Aspects of Logical Procedure Definition. Information Systems 5 (1980), 167–187

    Google Scholar 

  15. Sistla, A.P./ Clarke, E.M.: The Complexity of Propositional Linear Temporal Logic. Journal of the ACM 32 (1985), 733–749

    Google Scholar 

  16. Wolper, P.: Temporal Logic Can Be More Expressive. Information and Control 56 (1983), 72–99

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik, Abteilung Datenbanken, Technische Universität Braunschweig, Postfach 3329, D-3300, Braunschweig, Fed. Rep. Germany

    Udo W. Lipeck

  2. Computer Centre Institute of Architecture and Engineering, Chongqing, P. Rep. China

    Dasu Feng

Authors
  1. Udo W. Lipeck
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dasu Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lipeck, U.W., Feng, D. (1989). Construction of deterministic transition graphs from dynamic integrity constraints. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-50728-0_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50728-4

  • Online ISBN: 978-3-540-46076-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation