Skip to main content
SpringerLink
Log in

Nested Constraints and Application Conditions for High-Level Structures

  • Chapter
Formal Methods in Software and Systems Modeling

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3393))

Abstract

Constraints and application conditions are most important for transformation systems in a large variety of application areas. In this paper, we extend the notion of constraints and application conditions to nested ones and show that nested constraints can be successively transformed into nested right and left application conditions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.-H.: Constraints and application conditions: From graphs to high-level structures. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 287–303. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Ehrig, H., Habel, A.: Graph grammars with application conditions. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, pp. 87–100. Springer, Berlin (1986)

    Google Scholar 

  3. Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive highlevel replacement categories and systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 144–160. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Ehrig, H., Prange, U., Taentzer, G.: Fundamental theory of typed attributed graph transformation. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 161–177. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Ermel, C., Rudolf, M., Taentzer, G.: The AGG approach: Language and environment. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2, pp. 551–603. World Scientific, Singapore (1999)

    Google Scholar 

  6. Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae 26, 287–313 (1996)

    MATH  MathSciNet  Google Scholar 

  7. Habel, A., Müller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11(5), 637–688 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Heckel, R., Wagner, A.: Ensuring consistency of conditional graph grammars – a constructive approach. In: SEGRAGRA 1995. Electronic Notes in Theoretical Computer Science, vol. 2, pp. 95–104 (1995)

    Google Scholar 

  9. Immerman, N.: Relational queries computable in polynomial time. Information and Control 68(1-3), 86–104 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  10. Koch, M., Parisi-Presicce, F.: Describing policies with graph constraints and rules. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 223–238. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Lack, S., Sobociński, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 273–288. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Mahr, B., Wilharm, A.: Graph grammars as a tool for description in computer processed control: A case study. In: Graph-Theoretic Concepts in Computer Science, pp. 165–176. Hanser Verlag, München (1982)

    Google Scholar 

  13. Mosbah, M., Ossamy, R.: A programming language for local computations in graphs: Logical basis. Technical report, University of Bordeaux (2003)

    Google Scholar 

  14. Pennemann, K.-H.: Generalized constraints and application conditions for graph transformation systems. Master’s thesis, University of Oldenburg (2004)

    Google Scholar 

  15. Rensink, A.: Representing first-order logic by graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319–335. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carl v. Ossietzky University of Oldenburg, Germany

    Annegret Habel & Karl-Heinz Pennemann

Authors
  1. Annegret Habel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karl-Heinz Pennemann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski

  2. Dipartimento di Informatica, Università di Pisa,  

    Ugo Montanari

  3. Dpto de L.S.I., Universitat Politècnica de Catalunya, Campus Nord, Mòdul Omega, Jordi Girona 1-3, 08034, Barcelona, Spain

    Fernando Orejas

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  5. Philipps-Universität Marburg, Germany

    Gabriele Taentzer

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Habel, A., Pennemann, KH. (2005). Nested Constraints and Application Conditions for High-Level Structures. In: Kreowski, HJ., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds) Formal Methods in Software and Systems Modeling. Lecture Notes in Computer Science, vol 3393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31847-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31847-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24936-8

  • Online ISBN: 978-3-540-31847-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation