Skip to main content
SpringerLink
Log in

Using Reflection to Specify Transaction Sequences in Rewriting Logic

  • Conference paper
  • First Online:
Recent Trends in Algebraic Development Techniques

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

Abstract

We develop an application of the reflective properties of rewriting logic to the specification of the management process of broadband telecommunications networks. The application is illustrated by a process that modifies the demand of a service between two nodes in the network. The strategy language selected for controlling the process is based on the one presented in [2] which has been enhanced with a new operation that applies a strategy over a set of objects. The specification of the system is developed in the rewriting logic language Maude, which, thanks to its reflective capabilities, can also be used for specifying internally the strategies that control the system. Several modeling approaches are compared, emphasizing the benefits obtained from using reflection to control the rewriting process as opposed to the extra effort required to control the process at the object level itself.

★

Partially supported by CAM 06T-033-96.

★★

Partially supported by CICYT, TIC 95-0433-C03-01.

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. P. Borovanský, C. Kirchner, and H. Kirchner, Controlling rewriting by rewriting, in [12].

    Google Scholar 

  2. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer, Principles of Maude, in [12].

    Google Scholar 

  3. M. Clavel and J. Meseguer, Axiomatizing reflective logics and languages, in: G. Kiczales, ed., Proc. Reflection’96, San Francisco, CA, April 1996, 263–288.

    Google Scholar 

  4. M. Clavel and J. Meseguer, Reflection and strategies in rewriting logic, in [12].

    Google Scholar 

  5. M. Clavel and J. Meseguer, Internal strategies in a reflective logic, in B. Gramlich and H. Kirchner, eds., Proc. CADE-14 Workshop on Strategies in Automated Deduction, Townsville, Australia, July 1997, 1–12.

    Google Scholar 

  6. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, and J. Meseguer, Metalevel computation in Maude, in: C. Kirchner and H. Kirchner, eds., Proc. Second Int. Workshop on Rewriting Logic and its Applications, Pont-à-Mousson, France, Electronic Notes in Theoretical Computer Science 15, Elsevier, Sept. 19

    Google Scholar 

  7. N. Martí-Oliet and J. Meseguer, Rewriting logic as a logical and semantic framework, Technical report SRI-CSL-93-05, SRI International, August 1993. To appear in D. M. Gabbay, ed., Handbook of Philosophical Logic, Kluwer Academic Pub.

    Google Scholar 

  8. J. Meseguer, Rewriting as a unified model of concurrency, in: J.C.M. Baeten y J.W. Klop, eds., Proc. CONCUR’90, LNCS 458, Springer-Verlag, 1990, 384–400.

    Google Scholar 

  9. J. Meseguer, Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science 96 1992, 73–155.

    Article  MathSciNet  Google Scholar 

  10. J. Meseguer, A logical theory of concurrent objects and its realization in the Maude language, in: G. Agha, P. Wegner, and A. Yonezawa, eds., Research Directions in Concurrent Object-Oriented Programming, The MIT Press, 1993, 314–390.

    Google Scholar 

  11. J. Meseguer, Rewriting logic as a semantic framework for concurrency: A progress report, in: U. Montanari and V. Sassone, eds., Proc. CONCUR’96, LNCS 1119, Springer-Verlag, 1996, 331–372.

    Google Scholar 

  12. J. Meseguer, editor, Proc. First Int. Workshop on Rewriting Logic and its Applications, Asilomar, CA, Electronic Notes in Theoretical Computer Science 4, Elsevier, Sept. 1996.

    Google Scholar 

  13. I. Pita and N. Martí-Oliet, A Maude specification of an object-oriented database model for telecommunication networks, in [12]

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Escuela Superior de Informática, Universidad Complutense de Madrid, Spain

    Isabel Pita & Narciso Martí-Oliet

Authors
  1. Isabel Pita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Narciso Martí-Oliet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Lisbon, Campo Grande 1700, Lisbon, Portugal

    José Luiz Fiadeiro

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pita, I., Martí-Oliet, N. (1999). Using Reflection to Specify Transaction Sequences in Rewriting Logic. In: Fiadeiro, J.L. (eds) Recent Trends in Algebraic Development Techniques. Lecture Notes in Computer Science, vol 1589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48483-3_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-48483-3_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation