Skip to main content

Tight and Loose Semantics for Transformation Systems

  • Conference paper
  • First Online:

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

Abstract

When defining the requirements of a system, specification units typically are partial or incomplete descriptions of a system component. In this context, providing a complete description of a component means integrating all the existing partial views for that component. However, in many cases defining the semantics of this integration operation is not an easy task. In particular, this is the case when the framework used at the specification level is, in some sense, an “operational” one (e.g. a Petri net or a statechart). Moreover, this problem may also apply to the definition of compositional semantics for modular constructs for this kind of frameworks.

In this paper, we study this problem, at a general level. First, we define a general notion of framework whose semantics is defined in terms of transformations over states represented as algebras and characterize axiomatically the standard tight semantics. Then, inspired in the double-pullback approach defined for graph transformation, we axiomatically present a loose semantics for this class of transformation systems, exploring their compositional properties. In addition, we see how this approach may be applied to a number of formalisms.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Astesiano. H.-J. Kreowski, B. Krieg-Brueckner, Algebraic Foundations of System specification, IFIP State of the Art Reports, Springer, 1999.

    Google Scholar 

  2. K.R. Apt,, Logic Programming, in Handbook of Theoretical Computer Science, Vol B:Formal Models and Semantics, Chapter 10, Elsevier, 1990.

    Google Scholar 

  3. Astesiano, E., Zucca, E.: D-oids: A Model for Dynamic Data Types. Mathematical Structures in Computer Science 5 (1995), pp. 257–282

    Article  MATH  MathSciNet  Google Scholar 

  4. Boerger, E., Huggins, J.K.: Abstract State Machines 1988-1998; Commented ASM Bibliography, Bull. EATCS 64 (1998), pp. 105–127

    MATH  Google Scholar 

  5. H. Ehrig, A Categorical Concept of Constraints for Algebraic specifications; in: Categorical Methods in Computer Science-with Aspects from Topology, (H. Ehrig, H. Herrlich, H.-J. Kreowski, G. Preuss, eds.), Springer LNCS 393 (1989).

    Google Scholar 

  6. H.-D. Ehrich, Object specification, in [AKK 99], 1999.

    Google Scholar 

  7. H. Ehrig, R. Heckel, M. Llabres, F. Orejas, J. Padberg, G. Rozenberg A Rule-Based Framework with Incomplete Information, in Theory and Applications of Graph Transformations (H. Ehrig, G. Engels, H.-J. Kreowski, G. Rozenberg eds.), Springer LNCS 1764 (2000) 85–102.

    Google Scholar 

  8. A. Finkelstein, J. Kramer, B. Nuseibeh, M. Goedicke, L. Finkelstein, Viewpoints: A framework for integrating multiple perspectives in system development, Int. J. of Software and Knowledge Engineering 2,1 (1992) 31–58.

    Article  Google Scholar 

  9. J.A. Goguen, R.M. Burstall. Institutions: Abstract model theory for specification and programming, J. of the ACM 39(1), 95–146, (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Grosse-Rhode, M.: Algebra Transformation Systems and their Composition, Springer LNCS 1382 (1998), pp. 107–122

    Google Scholar 

  11. Gurevitch, Y.: Evolving Algebras, A Tutorial Introduction. Bull. EATCS 43 (1991), pp. 264–284

    Google Scholar 

  12. R. Heckel, Open Graph Transformation Systems:A New Approach to the Compositional Modelling of Concurrent and Reactive Systems, PhD Thesis, TU Berlin 1998.

    Google Scholar 

  13. R. Heckel, H. Ehrig, U. Wolter, A. Corradini, Double-Pullback Transitions and Coalgebraic Loose Semantics for Graph Transformation Systems, Applied Categorical Structures 9 (2001) 83–110.

    Article  MATH  MathSciNet  Google Scholar 

  14. R. Heckel, A. Corradini, H. Ehrig, M. Loewe, Horizontal and Vertical Structuring of Typed Graph Transformation Systems, Mathematical Structures in Computer Science 6(6) (1996) 613–648.

    MATH  MathSciNet  Google Scholar 

  15. P. Lucio, F. Orejas, E. Pino. An algebraic framework for the definition of compositional semantics of Normal Logic Programs. Journal of Logic Programming 40(1) (1999) 89–124.

    Article  MATH  MathSciNet  Google Scholar 

  16. Reisig, W.: Petri Nets. EATCS Monographs in TCS 4, Springer Verlag, 1985

    Google Scholar 

  17. Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Vol 1 Foundations, World Scientific, 1997

    Google Scholar 

  18. G. Schneider, J. Winters, Applying use cases, Addison Wesley, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orejas, F., Ehrig, H., Pino, E. (2002). Tight and Loose Semantics for Transformation Systems. In: Cerioli, M., Reggio, G. (eds) Recent Trends in Algebraic Development Techniques. WADT 2001. Lecture Notes in Computer Science, vol 2267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45645-7_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45645-7_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43159-6

  • Online ISBN: 978-3-540-45645-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics