A process model for data bases

ABSTRACT

we present a process model for data bases, which integrates concepts of relation, process, integrity constraint, event and period. The model allows one to specify the synchronization of processes and the constraints due to consumption and production of data. In particular we present the formalization which is carried out with the Petri Nets. These are obtained by using refining primitives which keep the interpretation simple for designers. The aspects of verification and validation of the specification are also examined.

REFERENCES

• 1: [BOD83] Bodart, F; Pigneur, Y. "Conception assistée des applications informatiques 1. Etude d'opportunité et analyse conceptuelle." Masson, 1983.
• 2: [BOS86] Bosc, P.; Bouzeghoub, M.; Chrisment, C.; Flory, A.; Jomier, G.; Miranda, S.; Rolland C.; Spaccapietra, S. "Interfaces bases de données avancées: quelles recherches pour quelles interfaces?". Journal Modèles et Base de Données, N4, sept. 1986.
• 3: [BRA82] Brams, C.W. "Réseaux de Petri: théorie et pratique". Edition Masson, 1982.
• 4: [DEA81] De Antonellis, V.; Zonta, B. "Modelling Events in data base application design". Proc 7th VLDB, Cannes, 1981.
• 5: Clarence A. Ellis , Gary J. Nutt, Office Information Systems and Computer Science, ACM Computing Surveys (CSUR), v.12 n.1, p.27-60, March 1980 [doi>10.1145/356802.356805]
• 6: [GIR83] Girel, B. "Outil pour la manipulation et la représentation graphique des Réseaux de Pétri" Mémoire de diplôme, Cahier du CUI No35, Université de Genève.
• 7: [GUY85] Guyot, J. "La spécification des traitements dans les bases de données et son exécution: un prototype" Actes INFORSID Luchon, 1985.
• 8: [GUY86] Guyot, J. "Un modéle de traitement pour les bases de données: un formalisme pour la spécification, la validation et l'exécution de la spécification d'une application". Thése de la Faculté des Sciences, Concept Moderne/Editions, Genève, Sept 1986.
• 9: [LAU75] Lauer, P.E.; Campbell, R.H. "Formal semantic of a class of high-level primitives for coodinating concurrent processes" Acta Informatica 5, 1975.
• 10: [LEO81] Léonard, M.; Luong, B. "Information System Design Approach Integrating Data and Transactions". Proc. 7th VLDB, Cannes, 1981.
• 11: [OLI82] Olivé, A. "DADES: a methodology for specification and design of information systems." Information system design methodologies: a comparative review. North Holland, 1982.
• 12: [PET80] Petri, C.A. "Introduction to general net theory". in Net theory and application, Springer Verlag, 1980.
• 13: James Lyle Peterson, Petri Net Theory and the Modeling of Systems, Prentice Hall PTR, Upper Saddle River, NJ, 1981
• 14: [QUE81] Queille, J.-P. "The CESAR system: an aided design and certification system for distributed applications". 2th conference of distributed computing system IEEE, Paris, 1981.
• 15: [RIC81] Richter, G. "IML - inscribed nets for modeling text processing and data base management". Proc. 7th VLDB, Cannes, 1981.
• 16: [ROL82] Rolland, C. "The REMORA methodology for information system design and management" Information system design methodologies: a comparative review. North Holland, 1982.
• 17: [TAR83] Tardieu, H.; Rochfeld, A.; Colletti, R. "La méthode MERISE: Principles et outils". Les éditions d'organisation, 1983.
• 18: [WAS82] Wasserman, A. "The user software engineering methodology: an overview" Information system design methodologies: a comparative review. North Holland, 1982.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.1 Logical Design
          Subjects: Data models

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.1 Requirements/Specifications
          Subjects: Methodologies (e.g., object-oriented, structured)
      D.2.4 Software/Program Verification
          Subjects: Validation
  D.3 PROGRAMMING LANGUAGES
  D.4 OPERATING SYSTEMS
      D.4.1 Process Management
          Subjects: Synchronization

  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines)

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Network problems

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.0 General
          Subjects: Security, integrity, and protection**

  I. Computing Methodologies
  I.6 SIMULATION AND MODELING

General Terms:
Design, Verification