Skip to main content
Springer Nature Link
Log in

Saturated LTSs for Adhesive Rewriting Systems

  • Conference paper
Graph Transformations (ICGT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6372))

Included in the following conference series:

Abstract

G-Reactive Systems (GRSs) are a framework for the derivation of labelled transition systems (LTSs) from a set of unlabelled rules. A label for a transition from A to B is a context C[ − ] such that C[A] may perform a reaction and reach B. If either all contexts, or just the ”minimal” ones, are considered, the resulting LTS is called saturated (GIPO, respectively). The borrowed contexts (BCs) technique addresses the issue in the setting of the DPO approach. Indeed, from an adhesive rewriting system (ARS) a GRS can be defined such that DPO derivations correspond to reactions, and BC derivations to transitions of the GIPO LTS. This paper extends the BCs technique in order to derive saturated LTSs for ARSs, applying it to capture bisimilarity for asynchronous calculi.

Supported by the MIUR Project SisteR, and carried out during the first author’s tenure of an ERCIM ”Alain Bensoussan” Fellowship Programme.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Amadio, R., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195(2), 291–324 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bénabou, J.: Introduction to bicategories. In: Midwest Category Seminar I. LNM, vol. 47, pp. 1–77. Springer, Heidelberg (1967)

    Chapter  Google Scholar 

  3. Birkedal, L., Debois, S., Hildebrandt, T.: On the construction of sorted reactive systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 218–232. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Bonchi, F.: Abstract Semantics by Observable Contexts. Ph.D. thesis, Department of Informatics, University of Pisa (2008)

    Google Scholar 

  5. Bonchi, F., Gadducci, F., König, B.: Synthesising CCS bisimulation using graph rewriting. Information and Computation 207(1), 14–40 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bonchi, F., Gadducci, F., Monreale, G.V.: Labelled transitions for mobile ambients (as synthesized via a graphical encoding). In: Hildebrandt, T., Gorla, D. (eds.) EXPRESS 2008. ENTCS, vol. 242(1), pp. 73–98. Elsevier, Amsterdam (2009)

    Google Scholar 

  7. Bonchi, F., Gadducci, F., Monreale, G.V.: Reactive systems, barbed semantics, and the mobile ambients. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 272–287. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Bonchi, F., König, B., Montanari, U.: Saturated semantics for reactive systems. In: LICS 2006, pp. 69–80. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  9. Bonchi, F., Brogi, A., Corfini, S., Gadducci, F.: On the use of behavioural equivalences for web services’ development. Fundamenta Informaticae 89(4), 479–510 (2008)

    MATH  MathSciNet  Google Scholar 

  10. Cardelli, L., Gordon, A.: Mobile ambients. Theoretical Computer Science 240(1), 177–213 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Cardelli, L.: Brane calculi. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 257–278. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Ehrig, H., König, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Mathematical Structures in Computer Science 16(6), 1133–1163 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gadducci, F.: Graph rewriting for the π-calculus. Mathematical Structures in Computer Science 17(3), 407–437 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gadducci, F., Heckel, R.: An inductive view of graph transformation. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 219–233. Springer, Heidelberg (1998)

    Google Scholar 

  15. Gadducci, F., Montanari, U.: A concurrent graph semantics for mobile ambients. In: Brookes, S., Mislove, M. (eds.) MFPS 2001. ENTCS, vol. 45. Elsevier, Amsterdam (2001)

    Google Scholar 

  16. Gianantonio, P.D., Honsell, F., Lenisa, M.: RPO, second-order contexts, and lambda-calculus. Logical Methods in Computer Science 5(3) (2009)

    Google Scholar 

  17. Grohmann, D., Miculan, M.: Reactive systems over directed bigraphs. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 380–394. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Grohmann, D., Miculan, M.: Deriving barbed bisimulations for bigraphical reactive systems. In: Corradini, A., Tuosto, E. (eds.) ICGT 2008 - Doctoral Symposium. Electronic Communications of the EASST, vol. 16. EASST (2009)

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  20. Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science 151(2), 437–486 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  21. Lack, S., Sobocinski, P.: Adhesive and quasiadhesive categories. Theoretical Informatics and Applications 39(3), 511–545 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  22. Leifer, J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243–258. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  23. Merro, M., Zappa Nardelli, F.: Behavioral theory for mobile ambients. Journal of the ACM 52(6), 961–1023 (2005)

    Article  MathSciNet  Google Scholar 

  24. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)

    Google Scholar 

  25. Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 16–35. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  26. OWL-S Coalition: OWL-S for services, www.ai.sri.com/daml/services/owl-s/

  27. Rangel, G., König, B., Ehrig, H.: Deriving bisimulation congruences in the presence of negative application conditions. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 413–427. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  28. Rangel, G., Lambers, L., König, B., Ehrig, H., Baldan, P.: Behavior preservation in model refactoring using DPO transformations with borrowed contexts. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 242–256. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  29. Rathke, J., Sassone, V., Sobociński, P.: Semantic barbs and biorthogonality. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 302–316. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  30. Rathke, J., Sobociński, P.: Deriving structural labelled transitions for mobile ambients. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 462–476. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  31. Sassone, V., Sobocinski, P.: Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing 10(2), 163–183 (2003)

    MATH  MathSciNet  Google Scholar 

  32. Sassone, V., Sobociński, P.: Reactive systems over cospans. In: LICS 2005, pp. 311–320. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  33. Sobociński, P.: Deriving bisimulation congruences from reduction systems. Ph.D. thesis, BRICS, Department of Computer Science, University of Aaurhus (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Saclay and LIX, École Polytechnique,  

    Filippo Bonchi

  2. Dipartimento di Informatica, Università di Pisa,  

    Fabio Gadducci, Giacoma Valentina Monreale & Ugo Montanari

Authors
  1. Filippo Bonchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabio Gadducci
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giacoma Valentina Monreale
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Franklinstr. 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  2. Afdeling Informatica, Universiteit Twente, Drienerlolaan 5, 7522, Enschede, NB, The Netherlands

    Arend Rensink

  3. Leiden Institute of Advanced Computer Science (LIACS), Universiteit Leiden, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  4. Fachgebiet Echtzeitsysteme, Technische Universität Darmstadt, Merckstraße 25, 64283, Darmstadt, Germany

    Andy Schürr

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonchi, F., Gadducci, F., Monreale, G.V., Montanari, U. (2010). Saturated LTSs for Adhesive Rewriting Systems. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds) Graph Transformations. ICGT 2010. Lecture Notes in Computer Science, vol 6372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15928-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15928-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15927-5

  • Online ISBN: 978-3-642-15928-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics