[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Dynamic graphs

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1996 (MFCS 1996)

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

  • 174 Accesses

Abstract

A model of processes of rewriting graphs is proposed in which concurrency and branching can be represented. Operations on structures representing processes of rewriting graphs are defined that allow one to construct such structures from simple components and to characterize sets of processes of rewriting graphs, including sets generated by graph grammars.

This work has been supported by the Italian National Council for Research (CNR-GNIM), by the Polish Academy of Sciences (IPI PAN), and by COMPUGRAPH Basic Research Esprit Working Group n. 7183.

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

Access this chapter

Log in via an institution

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. Corradini, A., Ehrig, H. Löwe, M., Montanari, U., Rossi, F.: An Event Structure Semantics for Safe Graph Grammars, in Proc. IFIP Working Conference PROCOMET, 1994, 417–439

    Google Scholar 

  2. Corradini, A., Montanari, U., Rossi, F.,: Graph Processes, to appear in Fundamenta Informaticae 26 (1996)

    Google Scholar 

  3. Degano, P., Meseguer, J., Montanari, U., Axiomatizing Net Computations and Processes, in the Proceedings of 4th LICS Symposium, IEEE, 1989, 175–185

    Google Scholar 

  4. Engelfriet, J., Branching Processes of Petri Nets, Acta Informatica 28 (1991), 575–591

    Article  Google Scholar 

  5. Montanari, U., Rossi, F., Graph Grammars as Context-Dependent Rewriting Systems, in Raoult, J.C. (Editor): Proc. of CAAP'92, Springer LNCS 581 (1992) 232–247

    Google Scholar 

  6. Montanari, U., Rossi, F.: Contextual Nets, Acta Informatica 32 (1995), 545–596

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Andrea Maggiolo-Schettini

  2. Instytut Podstaw Informatyki PAN, ul. Ordona 21, 01-237, Warszawa, Poland

    Józef Winkowski

Authors
  1. Andrea Maggiolo-Schettini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Józef Winkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wojciech Penczek Andrzej Szałas

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maggiolo-Schettini, A., Winkowski, J. (1996). Dynamic graphs. In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_168

Download citation

  • DOI: https://doi.org/10.1007/3-540-61550-4_168

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61550-7

  • Online ISBN: 978-3-540-70597-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation