Advertisement

ANIGRAF: An interactive system for the animation of graph rewriting systems with priorities

  • Michel Billaud
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 488)

References

  1. [Bi 89]
    M. Billaud, Some Backtracking Graph Algorithms expressed by Graph Rewriting Systems with Priorities, Internal Report LABRI no 8989.Google Scholar
  2. [Bi 90]
    M. Billaud, Un Interpréteur pour les Systèmes de Réécriture de Graphes avec Priorités, Internal Report LABRI no 9040 (in french).Google Scholar
  3. [BLMS 89]
    M. Billaud, P. Lafon, Y. Métivier, E. Sopena, Graph Rewriting Systems with Priorities, in Graph-theoretic Concepts in Computer Science, 15th Workshop on Graphs'89, LNCS 411, pp. 94–106.Google Scholar
  4. [La 90]
    J.L. Lafaye, Mémoire pour l'Obtention du D.U.T., Département Informatique, IUT'A', Université Bordeaux I (1990).Google Scholar
  5. [LM 90a]
    I. Litovsky, Y. Métivier, Graph Rewriting Systems as a Tool to design and to prove Graph and Network Algorithms, Internal Report LABRI no 9070.Google Scholar
  6. [LM 90b]
    I. Litovsky, Y. Métivier, Computing Trees with Graph Rewriting Systems with Priorities, Internal Report LABRI no 9085.Google Scholar
  7. [LM 90c]
    I. Litovsky, Y. Métivier, Computing with Graph Rewriting Systems with Priorities, Fourth International Workshop on Graph Grammars and Their Applications to Computer Science, Bremen (1990). Also Report LABRI no 9087.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Michel Billaud
    • 1
  1. 1.Département Informatique, IUT-AUniversité Bordeaux ITalence CedexFrance

Personalised recommendations