Skip to main content
SpringerLink
Log in

Parallel and Sequential Independence for Borrowed Contexts

  • Conference paper
Graph Transformations (ICGT 2008)

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

Included in the following conference series:

Abstract

Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were missing for dpo rewriting extended with borrowed contexts (dpobc), a formalism used for equipping dpo derivations with labels and introduced for modeling open systems that interact with the environment.

In this work we propose the definition of parallel and sequential independence for dpobc rewriting, and we prove that these novel notions allow generalizing the Church-Rosser and parallelism theorems holding for dpo rewriting. Most importantly, we show that the dpobc version of these theorems still guarantees the local confluence and the parallel execution of pairs of independent dpobc derivations.

Research partially supported by the EU FP6-IST IP 16004 SEnSOria.

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., 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 

  2. 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 

  3. Baldan, P., König, B., Ehrig, H.: Composition and decomposition of DPO transformations with borrowed context. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozemberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 153–167. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Gadducci, F.: Term graph rewriting and the π-calculus. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol. 2895, pp. 37–54. Springer, Heidelberg (2003)

    Google Scholar 

  5. Gadducci, F., Lluch-Lafuente, A.: Graphical encoding of a spatial logic for the π-calculus. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 209–225. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Bonchi, F., Gadducci, F., König, B.: Process bisimulation via a graphical encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozemberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 168–183. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic approaches to graph transformation I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, pp. 163–245. World Scientific, Singapore (1997)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  9. Lack, S., Sobociński, P.: Adhesive and quasiadhesive categories. Theoretical Informatics and Applications 39, 511–545 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. Winskel, G., Nielsen, M.: Models for concurrency. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S. (eds.) Handbook of Logic in Computer Science, vol. 4, pp. 1–148. Oxford University Press, Oxford (1992)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  13. Rabinovich, A.M., Trakhtenbrot, B.A.: Behaviour structures and nets. Foundamenta Informatica 11(4), 357–404 (1988)

    MATH  MathSciNet  Google Scholar 

  14. van Glabbeek, R.J., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol. 379, pp. 237–248. Springer, Heidelberg (1989)

    Google Scholar 

  15. Baldan, P., Corradini, A., Ehrig, H., Heckel, R., König, B.: Bisimilarity and behaviour-preserving reconfiguration of open petri nets. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 126–142. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Nielsen, M., Priese, L., Sassone, V.: Characterizing behavioural congruences for Petri nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 175–189. Springer, Heidelberg (1995)

    Google Scholar 

  17. Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae 26, 241–265 (1996)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa,  

    Filippo Bonchi & Fabio Gadducci

  2. Institut für Informatik und Interaktive Systeme, Universität Duisburg-Essen,  

    Tobias Heindel

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. Tobias Heindel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Berlin, Germany

    Hartmut Ehrig

  2. Department of Computer Science, University of Leicester, Leicester, UK

    Reiko Heckel

  3. Leiden Center for Natural Computing, Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

  4. Department of Mathematics and Computer Science, Philipps-University Marburg, Marburg, Germany

    Gabriele Taentzer

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonchi, F., Gadducci, F., Heindel, T. (2008). Parallel and Sequential Independence for Borrowed Contexts. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87405-8_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87404-1

  • Online ISBN: 978-3-540-87405-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation